
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Michael A. Palis, JingChiou Liou, David S.L. Wei, "Task Clustering and Scheduling for Distributed Memory Parallel Architectures," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 1, pp. 4655, January, 1996.  
BibTex  x  
@article{ 10.1109/71.481597, author = {Michael A. Palis and JingChiou Liou and David S.L. Wei}, title = {Task Clustering and Scheduling for Distributed Memory Parallel Architectures}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {1}, issn = {10459219}, year = {1996}, pages = {4655}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.481597}, 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  Task Clustering and Scheduling for Distributed Memory Parallel Architectures IS  1 SN  10459219 SP46 EP55 EPD  4655 A1  Michael A. Palis, A1  JingChiou Liou, A1  David S.L. Wei, PY  1996 KW  Program task graph KW  task granularity KW  task scheduling KW  distributed memory architectures KW  approximation algorithms. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—This paper addresses the problem of scheduling parallel programs represented as directed acyclic task graphs for execution on distributed memory parallel architectures. Because of the high communication overhead in existing parallel machines, a crucial step in scheduling is
[1] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: AddisonWesley, 1974.
[2] J. Baxter and J.H. Patel,"The last algorithm: A heuristicbased static allocation algorithm," Proc. 1989 Int'l Conf. on Parallel Processing, vol. 2, pp. 217222, 1989.
[3] P. Chretienne,"Complexity of tree scheduling with interprocessor communication delays," Tech. Report M.A.S.I. 90.5, UniversitéPierre et Marie Curie, 1990.
[4] Y.C. Chung and S. Ranka,"Applications and performance analysis of a compiletime optimization approach for list scheduling algorithms on distributed memory multiprocessors," Proc. Supercomputing '92, pp. 512521, 1992.
[5] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGrawHill, 1990.
[6] W. Dally,"Network and processor architecture for messagedriven computer," R. Suaya and G. Birtwistle, eds., VLSI and Parallel Computation.San Mateo, Calif.: Morgan Kaufmann, pp. 140218, 1990.
[7] A. Gerasoulis and T. Yang,"On the granularity and clustering of directed acyclic task graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, pp. 686701, June 1993.
[8] J.J. Hwang,Y.C. Chow,F.D. Anger, and C.Y. Lee,"Scheduling precedence graphs in systems with interprocessor communication times," SIAM J. Computing, vol. 18, no. 2, pp. 244257, Apr. 1989.
[9] S. Kim and J.C. Browne,"A general approach to mapping of parallel computation upon multiprocessor architectures," Proc. Int'l Conf. Parallel Processing, vol. 3, pp. 18, 1988.
[10] B. Kruatrachue and T. Lewis,"Grain size determination for parallel processing," IEEE Software, pp. 2332, Jan. 1988.
[11] C.Y. Lee,J.J. Hwang,Y.C. Chow, and F.D. Anger,"Multiprocessor scheduling with interprocessor communication delays," Oper. Res. Lett., vol. 7, no. 3, pp. 141147, 1988.
[12] T. Leighton,M. Newman,A.G. Ranada, and E. Schwabe,"Dynamic tree embeddings in butterflies and hypercubes," Proc. ACM Symp. Parallel Algorithms and Architectures, pp. 224234, 1989.
[13] C. McCreary and H. Gill,"Automatic determination of grain size for efficient parallel processing," Comm. ACM, pp. 1,0731,078, Sept. 1989.
[14] C. McCreary,A.A. Khan,J.J. Thompson, and M.E. McArdle,"A comparison of heuristics for scheduling DAGs on multiprocessors," Proc. Eighth Int'l Parallel Processing Symp., pp. 446451, 1994.
[15] C.H. Papadimitriou and M. Yannakakis,"Towards an architectureindependent analysis of parallel algorithms," SIAM J. Computing, vol. 19, no. 2, pp. 322328, Apr. 1990.
[16] 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.
[17] V. Sarkar,Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors.Cambridge, Mass.: MIT Press, 1989.
[18] M.Y. Wu and D.D. Gajski,"Hypertool: A programming aid for messagepassing systems," IEEE Transactions on Parallel and Distributed Systems, vol. 1, no. 3, pp. 330343, July 1990.
[19] T. Yang,"Scheduling and code generation for parallel architectures," PhD thesis, Rutgers Univ., May 1993. Tech. Report DCSTR299.