Communication contention in task scheduling

IEEE Transactions on Parallel and Distributed Systems

Volumn 16, Issue 6, 2005, Pages 503-515

  Sinnen, Oliver ^a   Sousa, Leonel A ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b INESC ID   (Portugal)

Author keywords

Communication contention; Concurrent programming; Heterogeneous system model; Parallel processing; Scheduling and task partitioning

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

COMMUNICATION CONTENTION; CONCURRENT PROGRAMMING; HETEROGENEOUS SYSTEM MODEL; TASK SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 21244458140     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2005.64     Document Type: Article

References (36)

1. T.L. Adam, K.M. Chandy, and J.R. Dickson, "A Comparison of List Schedules for Parallel Processing Systems," Comm. ACM, vol. 17, pp. 685-689, 1974.
2. I. Ahmad and Y.-K. Kwok, "On Exploiting Task Duplication in Parallel Program Scheduling," IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 8, pp. 872-892, Sept. 1998.
3. I. Ahmad, Y.-K. Kwok, and M.-Y. Wu, "Analysis, Evaluation, and Comparison of Algorithms for Scheduling Task Graphs on Parallel Processors," Proc. Second Int'l Symp. Parallel Architectures, Algorithms, and Networks, G.-J. Li, D.F. Hsu, S. Horiguchi, and B. Maggs, eds., pp. 207-213, June 1996.
4. O. Beaumont, V. Boudet, and Y. Robert, "A Realistic Model and an Efficient Heuristic for Scheduling with Heterogeneous Processors," Proc. 11th Heterogeneous Computing Workshop, 2002.
5. C. Berge, Graphs and Hypergraphs, second ed. North-Holland, 1976.
6. C. Boeres and V.E.F. Rebello, "A Versatile Cost Modelling Approach for Multicomputer Task Scheduling," Parallel Computing, vol. 25, no. 1, pp. 63-86, Jan. 1999.
7. S. Booth, J. Fisher, and M. Bowers, "Introduction to the Cray T3E at EPCC," Edinburgh Parallel Computing Centre, http://www.epcc. ed.ac.uk/t3d/documents/t3e-intro.html, June 1999.
8. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, 1990.
9. D.E. Culler, R.M. Karp, D.A. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, and T. von Eicken, "LogP: Towards a Realistic Model of Parallel Computation," ACM SIG-PLAN Notices, Proc. Symp. Principles and Practice of Parallel Programming, vol. 28, no. 7, pp. 1-12, July 1993.
10. D.E. Culler and J.P. Singh, Parallel Computer Architecture. Morgan Kaufmann Pubishers, 1999.
11. H. El-Rewini and T.G. Lewis, "Scheduling Parallel Program Tasks onto Arbitray Target Machines," J. Parallel and Distributed Computing, vol. 9, no. 2, pp. 138-153, June 1990.
12. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
13. A. Gerasoulis and T. Yang, "A Comparison of Clustering Heuristics for Scheduling DAGs on Multiprocessors," J. Parallel and Distributed Computing, vol. 16, no. 4, pp. 276-291, Dec. 1992.
14. 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. 244-257, Apr. 1989.
15. T. Kalinowski, I. Kort, and D. Trystram, "List Scheduling of General Task Graphs under LogP," Parallel Computing, vol. 26, pp. 1109-1128, 2000.
16. H. Kasahara and S. Narita, "Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing," IEEE Trans. Computers, vol. 33, pp. 1023-1029, Nov. 1984.
17. B. Kruatrachue, "Static Task Scheduling and Grain Packing in Parallel Processing Systems," PhD thesis, Oregon State Univ., 1987.
18. B. Kruatrachue and T. Lewis, "Grain Size Determination for Parallel Processing," IEEE Software, vol. 5, no. 1, pp. 23-32, Jan.
19. V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing - Design and Analysis of Algorithms. Benjamin/ Cummings, 1994.
20. Y.-K. Kwok and I. Ahmad, "Benchmarking the Task Graph Scheduling Algorithms," Proc. Int'l Parallel Processing Symp./Symp. on Parallel and Distributed Processing, pp. 531-537, Apr. 1998.
21. Y.-K. Kwok and I. Ahmad, "Link Contention-Constrained Scheduling and Mapping of Tasks and Messages to a Network of Heterogeneous Processors," Cluster Computing: J. Networks, Software Tools, and Applications, vol. 3, no. 2, pp. 113-124, 2000.
22. W. Löwe, W. Zimmermann, and J. Eisenberger, "On Linear Schedules of Task Graphs for Generalized LogP-Machines," Proc. Euro-Par '97, vol. 1300, pp. 895-904, 1997.
23. B.S. Macey and A.Y. Zomaya, "A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs," Proc. Int'l Parallel Processing Symp./Symp. Parallel and Distributed Processing, pp. 538-541, 1998.
24. "Message Passing Interface Forum," MPI: A Message-Passing Interface Standard, http://www.mpi-forum.org/docs/docs.html, June 1995.
25. P. Rebreyend, F.E. Sandnes, and G.M. Megson, "Static Multi-Processor Task Graph Scheduling in the Genetic Paradigm: A Comparison of Genotype Representations," Research Report 98-25, Laboratoire de Informatique du Parallelisme, Ecole Normale Superieure de Lyon, 1998.
26. V. Sarkar, Partitionning and Scheduling Parallel Programs for Execution on Multiprocessors. MIT Press, 1989.
27. G.C. Sih and E.A. Lee, "A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 175-186, Feb. 1993.
28. O. Sinnen, "Experimental Evaluation of Task Scheduling Accuracy," Tese de Mestrado, master's thesis, Instituto Superior Técnico, Technical Univ. of Lisbon, Dec. 2001.
29. O. Sinnen, "Accurate Task Scheduling for Parallel Systems," PhD thesis, Instituto Superior Técnico, Technical Univ. of Lisbon, Apr. 2003.
30. O. Sinnen and L. Sousa, "List Scheduling: Extension for Contention Awareness and Evaluation of Node Priorities for Heterogeneous Cluster Architectures," Parallel Computing, vol. 30, no. 1, pp. 81-101, Jan. 2004.
31. O. Sinnen and L. Sousa, "On Task Scheduling Accuracy: Evaluation Methodology and Results," J. Supercomputing, vol. 27, no. 2, pp. 177-194, Feb. 2004.
32. S. Telford, "BOBCAT User Guide," Edinburgh Parallel Computing Centre, http://www.epcc.ed.ac.uk/sun/documents/ introdoc.html, May 2000.
33. J.D. Ullman, "NP-Complete Scheduling Problems," J. Computing System Science, vol. 10, pp. 384-393, 1975.
34. M.Y. Wu and D.D. Gajski, "Hypertool: A Programming Aid for Message-Passing Systems," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 3, pp. 330-343, July 1990.
35. T. Yang and A. Gerasoulis, "PYRROS: Static Scheduling and Code Generation for Message Passing Multiprocessors," Proc. Sixth ACM Int'l Conf. Supercomputing, pp. 428-437, Aug. 1992.
36. T. Yang and A. Gerasoulis, "DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 9, pp. 951-967, Sept. 1994.