Divide-and-conquer mapping of parallel programs onto hypercube computers

Journal of Systems Architecture

Volumn 43, Issue 6-7, 1997, Pages 373-390

  Lor, Sam ^a,b   Shen, Hong ^b   Maheshwari, Piyush ^b,c  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b GRIFFITH UNIVERSITY   (Australia)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Clustering; Graph partitioning; Heuristic algorithm; Hypercube; Mapping problem; Task allocation assignment

Indexed keywords

CLUSTERING; DIVIDE AND CONQUER MAPPING; GRAPH PARTITIONING; HYPERCUBE COMPUTERS; PARALLEL PROGRAMS; TASK ALLOCATION;

C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; GRAPH THEORY; HEURISTIC PROGRAMMING; PARALLEL ALGORITHMS; PERFORMANCE;

PARALLEL PROCESSING SYSTEMS;

EID: 0031123078     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1383-7621(96)00052-5     Document Type: Article

References (20)

1. F. Berman, Experience with an automatic solution to the mapping problem, in: The Characteristics of Parallel Algorithms (MIT Press, 1987) 307-334.
2. S.H. Bokhari, On the mapping problem, IEEE Transactions on Computers 30(3) (1981) 207-214.
3. S.H. Bokhari, Assignment Problems in Parallel and Distributed Computing (Kluwer Academic Publishers, Boston, 1987).
4. S.H. Bokhari, A network flow model for load balancing in circuit-switched multicomputers, IEEE Transactions on Parallel and Distributed Systems 4(6) (June 1993).
5. T. Bultan and C. Aykanat, A new mapping heuristic based on mean field annealing, Journal of Parallel and Distributed Computing 16 (1992) 292-305.
6. M.Y. Chan and F. Chin, A parallel algorithm for an efficient mapping of grids in hypercubes, IEEE Transactions on Parallel and Distributed Systems 4(8) (August 1993) 933-946.
7. W. Chen, M.F.M. Stallman and E.F. Gehringer, Hypercube embedding heuristics: An evaluation, International Journal of Parallel Programming 18(6) (December 1989) 505-549.
8. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.M. Freeman and Co., 1979) 209-210.
9. D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation; Part 1, Graph partitioning, Operations Research 27(6) (1989) 865-892.
10. B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell System Technical Journal 49(2) (February 1970) 291-307.
11. R.S. Liggett, The quadratic assignment problem. An experimental evaluation of solution strategies, Management Science 27(4) (April 1981) 442-458.
12. V.M. Lo, Heuristic algorithms for task assignment in distributed systems, IEEE Transactions on Computers 37(11) (November 1988) 1384-1397.
13. S. Lor, H. Shen and P. Maheshwari, Divide-and-conquer minimal-cut bisectioning of task graphs. Proceedings of the 1994 Conference on Massively Parallel Computing Systems (Ischia, Italy, May 1994) 124-131.
14. S. Näher, LEDA user manual version 3.0, Max Planck Institut für Informatik, Saarbrücken, 1992.
15. M.G. Norman and P. Thanisch, Models of machines and computations for mapping in multicomputers, ACM Computing Surveys 25(3) (September 1993).
16. H. Shen, Self-adjusting mapping: A heuristic mapping algorithm for mapping parallel programs onto transputer networks, Computer Journal 35(1) (1992) 71-80.
17. H. Shen, Fast path-disjoint routing in transputer networks, Microprocessing and Microprogramming 33 (1991) 21-31.
18. P. Sadayappan, F. Ercal, and J. Ramanujam, Cluster partitioning approaches to mapping parallel programs onto a hypercube, Parallel Computing 13 (1990) 1-16.
19. C. Shen and W. Tsai, A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion, IEEE Transactions on Computers 34(3) (March 1985) 197-203.
20. S. Ullman and B. Narahari, Mapping binary precedence trees to hypercubes, Parallel Processing Letters 2(1) (1992) 81-87.