Optimal Scheduling Algorithm for Distributed-Memory Machines
Optimal Scheduling Algorithm for Distributed-Memory Machines
复制标题
DOI：
10.1109/71.655248
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
S. Darbha;D. Agrawal
中科院分区：
文献类型：
--
作者：
S. Darbha;D. Agrawal
任务调度是分布式存储机的关键技术之一，有效的调度算法可以减少处理器间的通信时间。由于DMM任务的优化调度是一个强NP难问题，文献中引入了许多启发式算法。本文提出了一种基于任务复制的调度算法（TDS），该算法能以O（|V|/sup 2/），其中|V|是DAG中的任务数。该算法为一类满足简单费用关系的DAG生成最优调度。该算法的性能已观察到其应用到一些实际的DAG，并通过比较它与其他现有的调度方案的调度长度和算法复杂度。
Task Scheduling is one of the key elements in any distributed-memory machine (DMM), and an efficient algorithm can help reduce the interprocessor communication time. As optimal scheduling of tasks to DMMs is a strong NP-hard problem, many heuristic algorithms have been introduced in the literature. This paper presents a Task Duplication based Scheduling (TDS) algorithm which can schedule directed acyclic graphs (DAGs) with a complexity of O(|V|/sup 2/), where |V| is the number of tasks in the DAG. This algorithm generates an optimal schedule for a class of DAGs which satisfy a simple cost relationship. The performance of the algorithm has been observed by its application to some practical DAGs, and by comparing it with other existing scheduling schemes in terms of the schedule length and algorithm complexity.