Partitioning and mapping of parallel programs by self-organization

Concurrency Practice and Experience

Volumn 8, Issue 9, 1996, Pages 685-706

  Heiss, Hans Ulrich ^a   Dormanns, Marcus ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Distributed memory parallel computers; Heuristics; Kohonen networks; Mapping; Optimization; Partitioning

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER WORKSTATIONS; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; LOCAL AREA NETWORKS; OPTIMIZATION; PROGRAM PROCESSORS; PROGRAMMING THEORY; TOPOLOGY;

COMMUNICATING TASKS; KOHONEN SELF ORGANIZING GRAPHS; PARTITIONING; PROGRAM MAPPING;

PARALLEL PROCESSING SYSTEMS;

EID: 0030282210     PISSN: 10403108     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1096-9128(199611)8:9<685::AID-CPE235>3.0.CO;2-A     Document Type: Article

References (30)

1. N. Chrisochoides, E. Houstis and J. Rice, 'Mapping algorithms and software environment for data parallel PDE iterative solvers', J. Parallel Distrib. Comput., 21, 75-95 (1994).
2. G. C. Fox, R. D. Williams and P. C. Messina, Parallel computing works!, Morgan Kaufmann Publ, San Francisco, 1994.
3. P. Sadayappan, F. Ercal and J. Ramanujam, 'Cluster partitioning approaches to mapping parallel programs onto a hypercube', Parallel Comput., 13, 1-16 (1990).
4. R. P. Williams, 'Performance of dynamic load balancing algorithms for unstructured mesh calculations', Concurrency: Pract. Exp., 3, (5), 457-481 (1991).
5. J. DeKeyser and D. Roose, 'Load balancing data parallel programs on distributed memory computers', Parallel Comput., 19, 1199-1219 (1993).
6. D. Roose and R. Van Driessche, 'Distributed memory parallel computers and computational fluid dynamics', Internal Report TW186, Department of Computer Science, K.U. Leuven, Belgium, 1993.
7. S. T. Barnard and H. D. Simon, 'Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems', Concurrency: Pract. Exp., 6, (2), 101-117 (1994).
8. W. J. Camp, S. J. Plimpton, B. A. Hendrickson and R. W. Leland, 'Massively parallel methods for engineering and science problems', Commun. ACM, 34, (4), 31-41 (1994).
9. B. W. Kernighan and S. Lin, 'An efficient heuristic for partitioning graphs', Bell Syst. J., 49, 291-307 (1970).
10. N. Mansour, 'Physical optimization algorithms for mapping data to distributed-memory multiprocessors', PhD thesis, Computer Science Department, Syracuse University, 1992.
11. M. Dormanns and H.-U. Heiss, 'Partitioning and mapping of large FEM-graphs by self-organization', Proc. Euromicro Workshop on Par. and Distr. Processing, San Remo, Italy, IEEE, 1995, pp. 227-235.
12. B. Hendrickson and R. Leland, 'An improved spectral graph partitioning algorithm for mapping parallel computations', SIAM J. Sci. Comput., 16, (2), 452-469 (1995).
13. T. Chockalingam and S. Arankumar, 'A randomized heuristics for the mapping problem: The genetic approach', Parallel Comput., 18, 1157-1165 (1992).
14. N. Mansour and G. C. Fox, 'A hybrid genetic algorithm for task allocation in multicomputers', Proc. Int. Conf. on Genetic Algorithms, San Diego, 1991, pp. 466-473.
15. S. W. Bollinger and S. F. Midkiff, 'Heuristic technique for processor and link assignment in multicomputers', IEEE Trans. Comput., 40, (3), 325-333 (1991).
16. T. Bultan and C. Aykanat, 'A new mapping heuristic based on mean field annealing', J. Parallel Distrib. Comput., 16, 292-305 (1992).
17. H. Mühlenbein, M. Gorges-Schleuter and O. Krämer, 'New solutions to the mapping problem of parallel systems: The evolution approach', Parallel Comput., 4, 269-279 (1987).
18. V. M. Lo, 'Heuristic algorithms for task assignment in distributed systems', IEEE Trans., 37, (11), 1384-1397 (1988).
19. F. C. H. Lin and R. M. Keller, 'The gradient model load balancing method', IEEE Trans. Softw. Eng., 13, (1), 32-38 (1987).
20. E. J. Boillat and P. G. Kropf, 'A fast distributed mapping algorithm', CONPAR 90 (Int. Conf. on Vector and Parallel Processing), pp. 405-416.
21. H.-U. Heiss and M. Schmitz, 'Decentralized dynamic load balancing: the particles approach', in Gun, L., Onvural, R. and Gelenbe, E. (Eds.): Proc. 8th Int. Symp. on Computer and Information Sciences (ISCIS VIII), Istanbul, November 1993; also to be published in Inf. Sci. - Intell. Syst.
22. H.-U. Heiss and M. Schmitz, 'Decentralized dynamic load balancing: the particles approach', in Gun, L., Onvural, R. and Gelenbe, E. (Eds.): Proc. 8th Int. Symp. on Computer and Information Sciences (ISCIS VIII), Istanbul, November 1993; also to be published in Inf. Sci. - Intell. Syst.
23. T. Kohonen, Self-organization and Associative Memory, 3rd edn., Springer-Verlag, Berlin, 1989.
24. H. Ritter, T. Martinetz and K. Schulten, Neural computation and self-organizing maps, Addison Wesley, 1991.
25. H.-U. Heiss and M. Dormanns, 'Task assignment by self-organizing maps', Internal Report 17/93, Department of Informatics, University of Karlsruhe, Germany.
26. M. Dormanns and H.-U. Heiss, 'Mapping large FEM-graphs to highly parallel computers with grid-like topology by self-organization', Internal Report 5/94, Dept. of Informatics, University of Karlsruhe, Germany, Febuary 1994.
27. C. Walshaw, M. Cross and M. G. Everett, 'A parallelisable algorithm for optimizing unstructured mesh partitions', Technical Report, School of Mathematics, Statistics and Scientific Computing, University of Greenwich, London, January 1995.
28. B. Hendrickson and R. Leland, 'The chaco's user's guide', Technical Report SAND93-2339, Sandia National Labs, Albuquerque, NM 87185, USA, October 1993,.
29. G. C. Fox, 'A graphical approach to load balancing and sparce matrix vector multiplication on the hypercube', in Schultz, E. (Ed.): Numerical Algoritlms for Modern Parallel Computers, Springer, Berlin, 1988.
30. S.-Y. Lee and J. K. Aggarwal, 'A mapping strategy for parallel processing', IEEE Trans. Comput., 36, (4), 433-142 (1987).