A Survey on Scheduling Algorithms for Parallel and Distributed Systems
A Survey on Scheduling Algorithms for Parallel and Distributed Systems
复制标题
并行分布式系统调度算法综述
DOI：
10.1007/978-981-10-7656-5_7
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
S. Gupta
中科院分区：
文献类型：
--
作者：
R. Tyagi;S. Gupta
任务调度在分布式计算中起着至关重要的作用。它通过将适当的任务分配给适当的处理器来最小化总体执行时间并减少诸如通信延迟之类的开销问题，从而增强了系统的性能。本文讨论了用于任务调度的各种调度技术。讨论了并发系统的分层分类方法，并在此基础上介绍了几种基于依赖关系的任务调度算法，以及针对低吞吐量和高效性能所采用的静态或动态调度方法。
Task scheduling plays a vital role in distributed computing. It enhances the performance of the system as it minimizes the overall execution time and reduces overhead problems like communication delay by allocating suitable task to appropriate processor. Different scheduling techniques are discussed in this paper which are employed for task scheduling. Taxonomy of hierarchical classification is discussed for concurrent system and further several task scheduling algorithms are described on the basis of dependency and approach used such as static or dynamic for low throughput and efficient performance.