The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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 <it>O</it>(|<it>V</it>|<super>2</super>), where |<it>V</it>| 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.</p>
Directed acyclic graph, distributed-memory machines, optimal scheduling algorithms, task duplication, task scheduling.

D. P. Agrawal and S. Darbha, "Optimal Scheduling Algorithm for Distributed-Memory Machines," in IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 87-95, 1998.
96 ms
(Ver 3.3 (11022016))