Improved schemes for mapping arbitrary algorithms onto processor meshes

Parallel Computing

Volumn 22, Issue 5, 1996, Pages 701-724

  Robič, Borut ^a,b   Vilfan, Boštjan ^b  

^a JO EF STEFAN INSTITUTE   (Slovenia)

^b UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

Combinatorial optimization; Distributed memory message passing multiprocessor; Embedding; Heuristic algorithm; Mapping; Performance optimization; Regular topology

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC PROGRAMMING; MATHEMATICAL TECHNIQUES; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PERFORMANCE; PROGRAM PROCESSORS; TOPOLOGY;

HEURISTIC REFINEMENT PROCEDURE; MESH TOPOLOGIES; MESSAGE PASSING;

PARALLEL ALGORITHMS;

EID: 0030216330     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(96)00019-1     Document Type: Article

References (15)

1. S.H. Bokhari, On the mapping problem, IEEE Trans. Comput. 30(3) (March 1981) 207-214.
2. H.-A. Choi and B. Narahari, Efficient algorithms for mapping and partitioning a class of parallel computations, J. Parallel Distributed Comput. 19(4) (Dec. 1993) 349-363.
3. J.B. Dennis, Dataflow supercomputers, IEEE Computer 13(11) (Nov. 1980) 48-56.
4. K. Fukunaga, S. Yamada and T. Kasai, Assignment of job modules onto array processors, IEEE Trans. Comput. 36(7) (July 1987) 888-891.
5. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness (W.H. Freeman and Co., 1979).
6. I. Koren and G.M. Silberman, A direct mapping of algorithms onto VLSI processing arrays based on the data flow approach, in: Proc. 1983 Int. Conf. Parallel Processing (Aug. 1983) 335-337.
7. I. Koren, B. Mendelson, I. Peled and G.M. Silberman, A data-driven VLSI array for arbitrary algorithms, IEEE Computer 21(10) (Oct. 1988) 30-43.
8. O. Kraemer and H. Muehlenbein, Mapping strategies in message-based multiprocessor systems, Parallel Comput. 9(2) (1988/89) 213-255.
9. P.J. van Laarhoven and E.H.L. Aarts, Simulated annealing: theory and applications (Kluwer Academic Press, 1987).
10. C. Lee and L. Bic, Comparing quenching and slow simulated annealing on the mapping problem, in: Proc. 3rd Annual Parallel Proc. Symp. (March 1989) 671-685.
11. L.M. Patnaik, R. Govindarajan and N.S. Ramadoss, Design and performance evaluation of EXMAN: An EXtended MANchester data flow computer, IEEE Trans. Comput. 35(3) (March 1986) 229-244.
12. B. Robič and J. Šilc, Algorithm mapping with parallel simulated annealing, Comput. Artif. Intell. 14(4) (1995) 339-351.
13. B. Robič, P. Kolbezen and J. Šilc, Area optimization of dataflow-graph mappings, Parallel Comput. 18(3) (March 1992) 297-311.
14. P. Sadayappan and F. Ercal, Nearest-neighbor mapping of finite element graphs onto processor meshes, IEEE Trans. Comput. 36(12) (Dec. 1987) 1408-1424.
15. S. Weiss, I.Y. Spilinger, and G.M. Silberman, Architectural improvements for a data-driven VLSI processing array, J. Parallel Distributed Comput. 19(4) (Dec. 1993) 308-322.