This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Optimal Scheduling Algorithm Based on Task Duplication
April 2002 (vol. 51 no. 4)
pp. 444-448

Under the condition where communication time is relatively shorter than the computation time for a given task, the task duplication-based scheduling (TDS) algorithm proposed by Darbha and Agrawal generates an optimal schedule. In this paper, we propose an extended TDS algorithm whose optimality condition is less restricted and the length of the generated schedule is shorter than the TDS algorithm.

[1] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[2] R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G.R. Kan, “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey,” Annals of Discrete Math., vol. 5, pp. 287-326, 1979.
[3] C.H. Papadimitriou and M. Yannakakis,"Towards an architecture-independent analysis of parallel algorithms," SIAM J. Computing, vol. 19, no. 2, pp. 322-328, Apr. 1990.
[4] M.A. Palis, J.-C. Liou, and D.S.L. Wei, “Task Clustering and Scheduling for Distributed Memory Parallel Architectures,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 1, pp. 46-55, Jan. 1996.
[5] A. Gerasoulis and T. Yang, “A Comparison of Clustering Heuristics for Scheduling Directed Acyclic Graphs on Multiprocessors,” J. Parallel and Distributed Computing, vol. 16, pp. 276-291, 1992.
[6] B. Kruatrachue and T. Lewis,"Grain size determination for parallel processing," IEEE Software, pp. 23-32, Jan. 1988.
[7] S. Darbha and D.P. Agrawal, Optimal Scheduling Algorithm for Distributed-Memory Machines IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 1, pp. 87-95, Jan. 1998.
[8] J.Y. Colin and P. Chretienne, “C.p.m. Scheduling with Small Computation Delays and Task Duplication,” Operations Research, pp. 680-684, 1991.
[9] C.-I. Park and T.-Y. Choe, “An Optimal Scheduling Algorithm Based on Task Duplication,” Technical Report CS-SS-2000-004, Dept. of Computer Science and Eng., POSTECH, Aug. 2000.

Index Terms:
scheduling, parallel system, task duplication, optimality conditions, task clustering
Citation:
C.I. Park, T.Y. Choe, "An Optimal Scheduling Algorithm Based on Task Duplication," IEEE Transactions on Computers, vol. 51, no. 4, pp. 444-448, April 2002, doi:10.1109/12.995454
Usage of this product signifies your acceptance of the Terms of Use.