
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sekhar Darbha, Dharma P. Agrawal, "Optimal Scheduling Algorithm for DistributedMemory Machines," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 1, pp. 8795, January, 1998.  
BibTex  x  
@article{ 10.1109/71.655248, author = {Sekhar Darbha and Dharma P. Agrawal}, title = {Optimal Scheduling Algorithm for DistributedMemory Machines}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {1}, issn = {10459219}, year = {1998}, pages = {8795}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.655248}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Optimal Scheduling Algorithm for DistributedMemory Machines IS  1 SN  10459219 SP87 EP95 EPD  8795 A1  Sekhar Darbha, A1  Dharma P. Agrawal, PY  1998 KW  Directed acyclic graph KW  distributedmemory machines KW  optimal scheduling algorithms KW  task duplication KW  task scheduling. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Task Scheduling is one of the key elements in any distributedmemory machine (DMM), and an efficient algorithm can help reduce the interprocessor communication time. As optimal scheduling of tasks to DMMs is a strong NPhard 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
[1] T.L. Adam, K.M. Chandy, and J.R. Dickson, “A Comparison of List Schedules for Parallel Processing Systems,” Comm. ACM, vol. 17, no. 12, pp. 685690, Dec. 1974.
[2] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: AddisonWesley, 1974.
[3] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation.Englewood Cliffs, N.J.: Prentice Hall International, 1989.
[4] H.B. Chen, B. Shirazi, K. Kavi, and A.R. Hurson, "Static Scheduling Using Linear Clustering with Task Duplication," Proc. ISCA Int'l Conf. Parallel and Distributed Computing and Systems, pp. 285290,Louisville, Ky., Oct.1416 1993.
[5] J.Y. Colin and P. Chritienne, "C.P.M. Scheduling with Small Communication Delays and Task Duplication," Operations Research, vol. 39, no. 4, pp. 680684, July 1991.
[6] S. Darbha and D.P. Agrawal, "SDBS: A Task Duplication Based Optimal Scheduling Algorithm," Proc. Scalable High Performance Computing Conf., pp. 756763,Knoxville, Tenn., May2325 1994.
[7] H.E. Rewini and T.G. Lewis,"Scheduling parallel program tasks onto arbitrary target machines," J. Parallel and Distributed Computing, vol. 9, pp. 138153, 1990.
[8] 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. 276291, 1992.
[9] R.L. Graham, L.E. Lawler, J.K. Lenstra, and A.H. Kan, "Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey," Annals of Discrete Mathematics, pp. 287326, 1979.
[10] O.H. Ibarra and S.M. Sohn, "On Mapping Systolic Algorithms onto the Hypercube," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 1, pp. 4863, Jan. 1990.
[11] S.J. Kim and J.C. Browne, "A General Approach to Mapping of Parallel Computation upon Multiprocessor Architectures," Int'l Conf. Parallel Processing, vol. 3, pp. 18, 1988.
[12] J.P. Kitajima and B. Plateau, "Building Synthetic Parallel Programs: The Project (ALPES)," Proc. IFIP WG 10.3 Workshop on Programming Environments for Parallel Computing, pp. 161170,Edinburgh, Scotland, Apr.68, 1992.
[13] B. Kruatrachue,“Static taskscheduling and grain packing in parallel processing systems,”Ph.D. dissertation, Comput. Sci. Dep., Oregon State Univ., 1987.
[14] Y.K. Kwok and I. Ahmad, "Exploiting Duplication to Minimize the Execution Times of Parallel Programs on MessagePassing Systems," Proc. Sixth IEEE Symp. Parallel and Distributed Processing, pp. 426433, Oct.2629, 1994.
[15] S. S. Pande, D. P. Agrawal, and J. Mauney,“A new threshold scheduling strategy for Sisal programs on distributed memory machines,”J. Parallel And Distrib. Comput., vol. 21, no. 2, pp. 223–236, May 1994.
[16] S.S. Pande, D.P. Agrawal, and J. Mauney, "A Scalable Scheduling Method for Functional Parallelism on Distributed Memory MultiProcessors," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 4, pp. 388399, Apr. 1995.
[17] V. Sarkar,Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors.Cambridge, Mass.: MIT Press, 1989.
[18] G.C. Sih and E.A. Lee, “A CompileTime Scheduling Heuristic for InterconnectionConstrained Heterogeneous Processor Architectures,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 175186, Feb. 1993.
[19] M.Y. Wu and D. Gajski, "A Programming Aid for Hypercube Architectures," J. Supercomputing, vol. 2, pp. 349372, 1988.