Performance comparison of strategies for static mapping of parallel programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1225, Issue , 1997, Pages 575-587

  Senar, M A ^a   Ripoll, A ^a   Cortes A ^a   Luque, E ^a  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

Author keywords

Distributed memory parallel machines; Heuristics; Mapping; Program graphs; Static load balancing; Task assignment

Indexed keywords

BALANCING; ECONOMIC AND SOCIAL EFFECTS; HEURISTIC ALGORITHMS; ITERATIVE METHODS; MAPPING; MEMORY ARCHITECTURE; MESSAGE PASSING; TABU SEARCH; TOPOLOGY; TREES (MATHEMATICS);

HEURISTICS; PARALLEL MACHINE; PROGRAM GRAPHS; STATIC LOAD BALANCING; TASK ASSIGNMENT;

SIMULATED ANNEALING;

EID: 84979059306     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0031630     Document Type: Conference Paper

References (19)

1. M. G. Norman & P. Thanish, "Models of machines and computation for mapping in multicomputers". ACM Computer Surveys, 25 (3) (1993), pp. 263- 302.
2. O. Krämer and H. Mühlenbein, "Mapping strategies in message-based multiprocessor systems", Parallel Computing, Vol. 9 (1988/89), pp. 213-225.
3. H. A. Choi and B. Narahari, "Efficient algorithms for mapping and partitioning a class of parallel computations", J. Parallel Distributed Computing. 19(4) (1993), pp. 349-363.
4. C. Lee and L. Bic, "Comparing quenching and slow simulated annealing on the mapping problem", Proc. 3rd. Annual Parallel Proc. Symp. (1989), pp. 671-685.
5. M. R. Garey and D. S. Johnson, "Computer and Intractability - A Guide to the Theory of NP-Completeness", (Freeman, New York, 1979).
6. P. Bouvry, J. Chassin de Kergommeaux & D. Trystram, "Efficient solutions for mapping parallel programs". Proc. of EuroPar'95. Springer-Verlag, August (1995), pp. 379-390.
7. V. Chaudhary and J. Aggarwal, "A generalized scheme for mapping parallel algorithms", IEEE Trans, on Parall. and Distrib. Systems, Vol. 4, no. 3 (1993), pp. 328-346.
8. V. M. Lo, "Algorithms for static assignment and symmetric contraction in distributed computing systems", Proc IEEE Int. Conf. on Parallel Proc., (1988), pp. 239-244.
9. P. Sadayappan, F. Ercal and J. Ramanujam, "Cluster partitioning approaches to mapping parallel problems on to a hypercube", Parallel Computing, 13 (1) (1990), pp. 1-6.
10. P. Sadayappan and F. Ercal, "Nearest-neighbor mapping of finite element graphs onto processor meshes", IEEE Trans. Comput, Vol 36, no. 12 (1990), pp. 1408- 1424.
11. S. Selvakumar & C. Silva Ram Murthy, "An efficient heuristic algorithm for mapping parallel programs onto multicomputers". Microprocessing and Microprogramming 36 (1992/1993) pp 83-92.
12. Shen Shen Wu & D. Sweeting, "Heuristic algorithms for task assignment and scheduling in a processor network". Parallel Computing 20 (1994), pp. 1-14.
13. T. Agerwala et alter, "SP2 system architecture", IBM Systems Journal, Vol. 34, No. 2(1995), pp. 152-184.
14. M. D. May, P. W. Thompson & P. H. Welch, "Networks, Routers & Transputers", IOS Press (1993).
15. A. Gerasoulis and T. Yang, "A comparison of heuristics for scheduling directed acyclic graphs on multiprocessors", J. of Par. and Distrib. Comput., Vol. 16 (1992), pp. 276-291.
16. M. A. Senar, A. Cortés, A. Ripoll and E. Luque, "A clustering-reassigning strategy for mapping parallel programs", Proc. of 8th IASTED Int. Conf. on Par. and Distrib. Computing and Systems, Acta Press, Anaheim, (1996), pp. 166-170.
17. M. A. Senar, A. Ripoll, A. Cortés and E. Luque, "An efficient clustering-based approach for mapping parallel programs", Proc. of 5th Euromicro Workshop on Parallel and Distributed Processing, London, January, (1997), pp. 407-412.
18. R. Graham, "Bounds on multiprocessing timing anomalies", SIAM, J. Appl. Math., Vol. 17, No. 2, (1969), pp. 416-429.
19. E. Luque et alter, "PSEE: a tool for parallel systems learning", Computers and Artificial Intelligence, Vol. 14, No. 1 (1996), pp. 319-339.