SDBS: a task duplication based optimal scheduling algorithm

SDBS: a task duplication based optimal scheduling algorithm
复制标题

SDBS：一种基于任务复制的最优调度算法

DOI：
10.1109/shpcc.1994.296717
复制
发表时间：
1994
期刊：
Proceedings of IEEE Scalable High Performance Computing Conference
影响因子：
--
通讯作者：
D. P. Agrawal
D. P. Agrawal
中科院分区：
--
文献类型：
--
作者：
S. Darbha;D. P. Agrawal

文献摘要

被引文献

相似文献

高效的调度算法是决定分布式存储机性能的关键因素之一。本文提出了一种基于搜索和复制的调度算法（SDBS），它可以调度有向无环图（DAG）。该调度算法的复杂度为O（V+E），其中V是任务图中的节点数，E是任务图中的边数。该算法是基于一些现实的假设，并产生一个最佳的时间表。如果不能完全满足假设，则算法提供接近最优的调度。在这些情况下的性能已经得到了广泛的模拟工作，表明结果的接近。&lt;<ETX>&gt;
An efficient scheduling algorithm is one of the key factors in determining the performance of distributed memory machines. The paper presents a search and duplication based scheduling (SDBS) algorithm which can schedule directed acyclic graphs (DAGs). The complexity of this scheduling algorithm is in O(V+E), where V is the number of nodes and E is the number of edges in the task graph. This algorithm is based on some realistic assumptions and generates an optimal time schedule. If the assumptions cannot be completely satisfied then the algorithm provides a schedule which is close to optimal. The performance in these cases has been obtained using extensive simulation work which indicate the closeness of the results.<<ETX>>