Abstract
Parallel algorithms, based on simulated annealing, neural networks and genetic algorithms, for mapping irregular data to multicomputers are presented and compared. The three algorithms deviate from the sequential versions in order to achieve acceptable speed-ups. The parallel annealing and neural algorithms include communication schemes adapted to the properties of the mapping problem and of the algorithms themselves. These schemes arc found useful for providing both good solutions and reasonable execution times. The parallel genetic algorithm is based on a model of natural evolution. The three algorithms preserve the high quality solutions and the non-bias properties of their sequential counterparts. Further, the comparison results show their suitability for different requirements of mapping time and quality.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Berger and S. Bokhari: A partitioning strategy for nonuniform problems on multiprocessors. IEEE Trans. Comp., Vol C-36,No. 5, 1987, 570–580.
N.P. Chrisochoides, E.N. Houstis, and C.E. Houstis: Geometry based mapping strategies for PDE computations. Int. Conf. on Supercomputing, 115–127, ACM Press 1991.
F. Ercal: Heuristic approaches to task allocation for parallel computing. Doctoral Dissertation, Ohio State University, 1988.
G. C. Fox, S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, C. Tseng, and M-Y. Wu: Fortran D language specification. Syracuse University, NPAC, SCCS-42, 1990.
G. C. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker: Solving problems on concurrent processors. Prentice Hall 1988.
G. C. Fox and W. Furmanski: Load balancing loosely synchronous problems with a neural network. Proc 3rd Conf. Hypercube Concurrent Computers, and Applications, 1988, 241–278.
D. E. Goldberg: Genetic algorithms in search, optimization and machine learning. Addison-Wesley 1989.
J. Hopfield and D. Tank: Computing with neural circuits: a model. Science 233, 1986, 625–639.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi: Optimization by simulated annealing. Science 220, 1983, 671–680.
N. Mansour and G. C. Fox: A hybrid genetic algorithm for task allocation. Int. Conf. Genetic Algorithms, July 1991, 466–473.
N. Mansour and G. C. Fox: Allocating data to multicomputer nodes by physical optimization algorithms. To appear in Concurrency Practice and Experience.
N. Mansour and G.C. Fox: Parallel physical optimization algorithms for allocating data to multicomputer nodes. Syracuse University, NPAC, SCCS-305, 1992.
N. Mansour and G.C. Fox: For efficient mapping of large problems. In preparation.
H. Simon: Partitioning of unstructured mesh problems for parallel processing. Proc. Conf. Parallel Methods on Large Scale Structural Analysis and Physics Applications, Permagon 1991.
R. D. Williams: Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency Practice and Experience, 3(5), Oct. 1991, 457–481.
S. Wright Evolution and the genetics of populations. Vol. 3, Univ. of Chicago Press 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mansour, N., Fox, G.C. (1992). Parallel physical optimization algorithms for data mapping. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_401
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_401
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive