List scheduling: Extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures

Parallel Computing

Volumn 30, Issue 1, 2004, Pages 81-101

  Sinnen, Oliver ^a   Sousa, Leonel ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Communication contention; Directed acyclic graph (DAG); Heterogeneous cluster architectures; List scheduling

Indexed keywords

ALGORITHMS; COMMUNICATION SYSTEMS; COMPUTATIONAL METHODS; GRAPH THEORY; HEURISTIC PROGRAMMING; PHASE TRANSITIONS; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES; SET THEORY; TELECOMMUNICATION LINKS; TOPOLOGY;

COMMUNICATION CONTENTION; DIRECTED ACYCLIC GRAPH (DAG); HETEROGENEOUS CLUSTER ARCHITECTURES; LIST SCHEDULINGS; STATIC SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 0347601909     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2003.09.002     Document Type: Article

References (32)

1. Adam T.L., Chandy K.M., Dickson J.R. A comparison of list schedules for parallel processing systems. Communications of the ACM. 17:1974;685-689.
2. Berge C. Graphs and Hypergraphs. second ed. 1976;North-Holland.
3. Coffman E.G., Graham R.L. Optimal scheduling for two-processor systems. Acta Informatica. 1:1972;200-213.
4. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press.
5. Cosnard M., Trystram D. Parallel Algorithms and Architectures. 1995;Int. Thomson Computer Press, London, UK.
6. Culler D.E., Singh J.P. Parallel Computer Architecture. 1999;Morgan Kaufmann Publishers.
7. Darte A., Robert Y., Vivien F. Scheduling and Automatic Parallelization. 2000;Brinkhäuser, Boston, USA.
8. El-Rewini H., Lewis T.G. Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing. 9(2):1990;138-153.
9. Gerasoulis A., Yang T. A comparison of clustering heuristics for scheduling DAGs on multiprocessors. Journal of Parallel and Distributed Computing. 16(4):1992;276-291.
10. Graham R.L. Bounds for multiprocessing timing anomalies. SIAM Journal on Applied Mathematics. 17(2):1969;416-419.
11. Hu T. Parallel sequencing and assembly line problems. Operations Research. 9:1961;841-848.
12. Hwang J.J., Chow Y.C., Anger F.D., Lee C.Y. Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal of Computing. 18(2):1989;244-257.
13. Kasahara H., Narita S. Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Transactions on Computers C. 33:1984;1023-1029.
14. A.A. Khan, C.L. McCreary, M.S. Jones, A comparison of multiprocessor scheduling heuristics. in: Proceedings of International Conference on Parallel Processing, vol. 2, August 1994, pp. 243-250.
15. B. Kruatrachue, Static task scheduling and grain packing in parallel processing systems, PhD Thesis, Oregon State University, USA, 1987.
16. Kruatrachue B., Lewis T. Grain size determination for parallel processing. IEEE Software. (January):1988;23-32.
17. Y.-K. Kwok, I. Ahmad, Bubble scheduling: a quasi dynamic algorithm for static allocation of tasks to parallel architectures, in: Proceedings of Symposium on Parallel and Distributed Processing (SPDP), Dallas, TX, USA, October 1995, pp. 36-43.
18. Y.-K. Kwok, I. Ahmad, Benchmarking the task graph scheduling algorithms, in: Proceedings of International Parallel Processing Symposium/Symposium on Parallel and Distributed Processing (IPPS/SPDP-98), Orlando, FL, USA, April 1998, pp. 531-537.
19. Kwok Y.-K., Ahmad I. Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors. Cluster Computing: The Journal of Networks, Software Tools, and Applications. 3(2):2000;113-124.
20. Lee C.Y., Hwang J.J., Chow Y.C., Anger F.D. Multiprocessor scheduling with interprocessor communication delays. Operations Research Letters. 7(3):1988;141-147.
21. Liu Z. A note on Graham's bound. Information Processing Letters. 36(October):1990;1-5.
22. B.S. Macey, A.Y. Zomaya, A performance evaluation of CP list scheduling heuristics for communication intensive task graphs, in: Parallel Processing Symposium, 1998, Proceedings of IPPS/SPDP 1998, 1998, pp. 538 -541.
23. Palis M.A., Liou J.-C., Wei D.S.L. Task clustering and scheduling for distributed memory parallel architectures. IEEE Transactions on Parallel and Distributed Systems. 7(1):1996;46-55.
24. Papadimitriou C.H., Yannakakis M. Towards an architecture-independent analysis of parallel algorithms. SIAM Journal of Computing. 19(2):1990;322-328.
25. Sandnes F.E., Megson G.M. An evolutionary approach to static taskgraph scheduling with task duplication for minimised interprocessor traffic. Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2001). Taipei, Taiwan, July 2001: 2001;101-108 Tamkang University Press.
26. Sarkar V. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. 1989;MIT Press.
27. Sih G.C., Lee E.A. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Transactions on Parallel and Distributed Systems. 4(2):1993;175-186.
28. H. Singh, A. Youssef, Mapping and scheduling heterogeneous task graphs using genetic algorithms, in: Proceedings of Heterogeneous Computing Workshop (HCW'96), Honolulu, HI, April 1996, IEEE Computer Society, pp. 86-97.
29. Sinnen O., Sousa L. Exploiting unused time slots in list-scheduling considering communication contention. Euro-Par 2001 Parallel Processing. Lecture Notes in Computer Science. vol. 2150:2001;166-170 Springer-Verlag.
30. Sinnen O., Sousa L. Scheduling task graphs on arbitrary processor architectures considering contention. High Performance Computing and Networking. Lecture Notes in Computer Science. vol. 2110:2001;373-382 Springer-Verlag.
31. Wang L., Siegel H.J., Roychowdhury V.P., Maciejewski A.A. Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach. Journal of Parallel and Distributed Computing. 47(November):1997;8-22.
32. Wu M.Y., Gajski D.D. Hypertool: A programming aid for message-passing systems. IEEE Transactions on Parallel and Distributed Systems. 1(3):1990;330-343.