Workload Schedulers -- Genesis, Algorithms and Differences
Leszek Sliwko, Vladimir Getov

TL;DR
This paper categorizes modern workload schedulers into three classes, analyzing their evolution, algorithms, and differences, highlighting common design focuses across local and distributed systems.
Contribution
It provides a comprehensive classification and comparison of scheduler types, detailing their development and key features, which was lacking in prior work.
Findings
Identified three main classes of workload schedulers.
Analyzed the evolution from early to modern implementations.
Highlighted commonalities in scheduling strategies across systems.
Abstract
This paper presents a novel approach to categorization of modern workload schedulers. We provide descriptions of three classes of schedulers: Operating Systems Process Schedulers, Cluster Systems Jobs Schedulers and Big Data Schedulers. We describe their evolution from early adoptions to modern implementations, considering both the use and features of algorithms. In summary, we discuss differences between all presented classes of schedulers and discuss their chronological development. In conclusion we highlight similarities in the focus of scheduling strategies design, applicable to both local and distributed systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed and Parallel Computing Systems · Real-Time Systems Scheduling · Cloud Computing and Resource Management
