Decentralized Task Scheduling In Distributed Systems: A Deep Reinforcement Learning Approach
2026 Β· Daniel Benniah John
Abstract
Efficient task scheduling in large-scale distributed systems presents significant challenges due to dynamic workloads, heterogeneous resources, and competing quality-of-service requirements. Traditional centralized approaches face scalability limitations and single points of failure, while classical heuristics lack adaptability to changing conditions. This paper proposes a decentralized multi-agent deep reinforcement learning (DRL-MADRL) framework for task scheduling in heterogeneous distributed systems. We formulate the problem as a Decentralized Partially Observable Markov Decision Process (Dec-POMDP) and develop a lightweight actor-critic architecture implemented using only NumPy, enabling deployment on resource-constrained edge devices without heavyweight machine learning frameworks. Using workload characteristics derived from the publicly available Google Cluster Trace dataset, we evaluate our approach on a 100-node heterogeneous system processing 1,000 tasks per episode over 30 e
Authors
(none)
Tags
Stats
Related papers
- Effective Multi-user Delay-constrained Scheduling With Deep Recurrent Reinforcement Learning (2022)7.16
- A Multi-task Approach To Robust Deep Reinforcement Learning For Resource Allocation (2023)0.00
- Distributed Deep Reinforcement Learning: An Overview (2020)0.00
- Digital Twin-assisted Efficient Reinforcement Learning For Edge Task Scheduling (2022)9.23
- Fully Distributed Actor-critic Architecture For Multitask Deep Reinforcement Learning (2021)3.58
- Scalable Centralized Deep Multi-agent Reinforcement Learning Via Policy Gradients (2018)0.00
- Network Slicing Via Transfer Learning Aided Distributed Deep Reinforcement Learning (2023)7.50
- Scaling Distributed Multi-task Reinforcement Learning With Experience Sharing (2023)0.00