GPR-161 Meta-Reinforcement Learning with Discrete World Models for Adaptive Load Balancing

We present a novel integration of the RL^2 meta-reinforcement learning algorithm with discrete world models, employing the DreamerV3 architecture, to enhance load balancing in operating systems. This integration allows for rapid adaptation to dynamic workload distributions with minimal retraining. In experiments using the Park load balancing environment, our approach outperformed the traditional AC3 algorithm in both standard and adaptive trials. Additionally, it exhibited strong resilience to catastrophic forgetting, maintaining high performance despite continuous variations in workload distribution and size. These results demonstrate the effectiveness of combining recurrent policy networks with discrete world models, offering a significant advancement in meta-learning capabilities for dynamic operating system environments. This work has important implications for improving resource management and performance in modern operating systems, addressing the challenges posed by increasingly dynamic and heterogeneous workloads.

Publication Details

Journal
DigitalCommons - Kennesaw State University (Kennesaw State University)
Published
2024-11-20
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GPR-161 Meta-Reinforcement Learning with Discrete World Models for Adaptive Load Balancing

DigitalCommons - Kennesaw State University (Kennesaw State University)
Distributed and Parallel Computing Systems
article

GPR-161 Meta-Reinforcement Learning with Discrete World Models for Adaptive Load Balancing

article en

Abstract

We present a novel integration of the RL^2 meta-reinforcement learning algorithm with discrete world models, employing the DreamerV3 architecture, to enhance load balancing in operating systems. This integration allows for rapid adaptation to dynamic workload distributions with minimal retraining. In experiments using the Park load balancing environment, our approach outperformed the traditional AC3 algorithm in both standard and adaptive trials. Additionally, it exhibited strong resilience to catastrophic forgetting, maintaining high performance despite continuous variations in workload distribution and size. These results demonstrate the effectiveness of combining recurrent policy networks with discrete world models, offering a significant advancement in meta-learning capabilities for dynamic operating system environments. This work has important implications for improving resource management and performance in modern operating systems, addressing the challenges posed by increasingly dynamic and heterogeneous workloads.

DigitalCommons - Kennesaw State University (Kennesaw State University)
Decent work and economic growth
Openalex Percentile: Top 50%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.