Clustering and reassignment-based mapping strategy for message-passing architectures

Journal of Systems Architecture

Volumn 48, Issue 8-10, 2003, Pages 267-283

  Senar, Miquel A ^a   Ripoll, Ana ^a   Cortés, Ana ^a   Luque, Emilio ^a  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

Author keywords

Clustering; Graph partitioning; Heuristic algorithms; Mapping problem; Task allocation assignment

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; GRAPH THEORY; HEURISTIC METHODS;

TASK ALLOCATION;

PARALLEL PROCESSING SYSTEMS;

EID: 0037370407     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1383-7621(03)00011-0     Document Type: Article

References (30)

1. Senar M.A., Cortés A., Ripoll A., Hluchy L., Astalos J. Dynamic load balancing. Cunha J.C., Kacsuk P., Winter S.C. Parallel Program Development for Cluster Computing - Methodology, Tools and Integrated Environments. 2001;69-95 Nova Science Publishers.
2. Garey M.R., Johnson D.S. Computer and Intractability - A Guide to the Theory of NP-Completeness, Freeman. 1979;Freeman, New York.
3. Lor S., Shen H., Maheshwari P. Divide-and-conquer mapping of parallel programs onto hypercube computers. Journal of Systems Architecture. 43:1997;373-390.
4. Sadayappan P., Ercal F., Ramanujam J. Cluster partitioning approaches to mapping parallel problems onto a hypercube. Parallel Computing. 13(1):1990;1-6.
5. Sadayappan P., Ercal F. Nearest-neighbor mapping of finite element graphs onto processor meshes. IEEE Transactions on Computers. 36(12):1990;1408-1424.
6. Hui C.C., Chanson S.T. Allocating task interaction graphs to processors in heterogeneous networks. IEEE Transactions on Parallel and Distributed Systems. 8(9):1997;908-925.
7. Kopidakis Y., Lamari M., Zissimopoulos V. On the task assignment problem: two new efficient heuristic algorithms. Journal of Parallel and Distributed Computing. 42:1997;21-29.
8. Lee C., Wang Y.-F., Yang T. Global optimization for mapping parallel image processing tasks on distributed memory machines. Journal of Parallel and Distributed Computing. 45:1997;29-45.
9. Lee C.-H., Shin K.G. Optimal task assignment in homogeneous networks. IEEE Transactions on Parallel and Distributed Systems. 8(2):1997;119-129.
10. T. Decker, R. Diekmann, Mapping of coarse-grained applications on workstation-clusters, in: Proceedings of Fifth Euromicro Workshop on Parallel and Distributed Processing, IEEE Computer Society Press, 1997, pp. 5-12.
11. Kitajima J.P.et al. ANDES: evaluating mapping strategies with synthetic programs. Journal of Systems Architecture. 42:1996;351-365.
12. Bultan T., Aykanat C. A new mapping heuristic based on mean field annealing. Journal of Parallel and Distributed Computing. 16:1992;292-305.
13. Ahmad I., Dhodhi M.K. Task assignment using problem-space genetic algorithm. Concurrency: Practice and Experience. 7(5):1995;411-428.
14. Schoneveld A., de Ronde J.F., Sloot P.M.A. Task allocation by parallel evolutionary computing. Journal of Parallell and Distributed Computing. 47:1997;91-97.
15. Norman M.G., Thanish P. Models of machines and computation for mapping in multicomputers. ACM Computer Surveys. 25(3):1993;263-302.
16. Yang T.et al. Mapping iterative task graphs on distributed-memory machines. International Conference on Parallel Processing. 1995;151-158.
17. Kafil M., Ahmad I. Optimal task assignment in heterogeneous distributed computing systems. IEEE Concurrency. 1998;42-51.
18. Cosnard M., Loi M. Automatic task graph generation techniques. Parallel Processing Letters. 5(4):1995;527-538.
19. Foster I. Designing and Building Parallel Programs. 1995;Addison-Wesley.
20. Shield J. Partitioning concurrent VLSI simulation programs onto a multiprocessor by simulated annealing. IEEE Proceedings Part G. (134):1987;24-28.
21. Chaudhary V., Aggarwal J.K. A generalized scheme for mapping parallel algorithms. IEEE Transactions on Parallel and Distributed Systems. 4(3):1993;328-346.
22. Lo V.M.et al. OREGAMI: tools for mapping parallel computations to architectures. International Journal of Parallel Programming. 20(3):1991;237-270.
23. Wu S.S., Sweeting D. Heuristic algorithms for task assignment and scheduling in a processor network. Parallel Computing. 20:1994;1-14.
24. Efe K. Heuristic models of task assignment scheduling in distributed systems. IEEE Transactions on Computers. 15(6):1982;50-56.
25. Gerasoulis A., Yang T. A comparison of heuristics for scheduling directed acyclic graphs on multiprocessors. Journal of Parallel and Distributed Computing. 16:1992;276-291.
26. M.A. Senar, A. Ripoll, A. Cortés, E. Luque, An efficient clustering-based approach for mapping parallel programs, in: Proceedings of Fifth Euromicro Workshop on Parallel and Distributed Processing, IEEE Press, London, 1997, pp. 407-412.
27. M.A. Senar, A. Ripoll, A. Cortés, E. Luque, Performance comparison of strategies for static mapping of parallel programs, in: Proceedings of HPCN Europe, LNCS, Springer-Verlag, 1997, pp. 575-587.
28. Bokhari S.H. On the mapping problem. IEEE Transactions on Computers. C-30(3):1981;207-214.
29. T. Yang, A. Gerasoulis, PYRROS: static task scheduling and code generation for message pasing multiprocessors, in: Proceedings of Sixth ACM International Conference on Supercomputing (ICS92), ACM Press, New York, NY, 1992, pp. 428-437.
30. C. Roig, A. Ripoll, M.A. Senar, F. Guirado, E. Luque, Exploiting knowledge of temporal behavior of parallel programs for improving distributed mapping, in: Proceedings of Sixth International Euro-Par Conference (Euro-Par2000), LNCS 1900, Springer-Verlag, 2000, pp. 262-271.