Workload Schedulers -- Genesis, Algorithms and Differences
By: Leszek Sliwko, Vladimir Getov
Potential Business Impact:
Organizes computer tasks to run faster.
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.
Similar Papers
Scheduling Data-Intensive Workloads in Large-Scale Distributed Systems: Trends and Challenges
Distributed, Parallel, and Cluster Computing
Organizes big computer jobs to finish faster.
Designing Co-operation in Systems of Hierarchical, Multi-objective Schedulers for Stream Processing
Distributed, Parallel, and Cluster Computing
Lets computers handle huge data faster.
A Review of Tools and Techniques for Optimization of Workload Mapping and Scheduling in Heterogeneous HPC System
Distributed, Parallel, and Cluster Computing
Makes supercomputers run much faster and smarter.