Abstract
We describe a static load balancing algorithm based on Kohonen Self-Organizing Maps (SOM) for a class of parallel computations where the communication pattern exhibits spatial locality and we present initial results. The topology preserving mapping achieved by SOM reduces the communication load across processors, however, it does not take load balancing into consideration. We introduce a load balancing mechanism into the SOM algorithm. We also present a preliminary multilevel implementation which resulted in significant execution time improvements. The results are promising to further improve SOM based load balancing for geometric graphs.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Kohonen, T.: The Self-Organizing Map Proc. of the IEEE, Vol.78, No. 9, September, 1990, pp. 1464–1480
Kernighan, B.W., Lin., S.: An Efficient Heuristic for Partitioning Graphs, Bell Syst. J., 49, 1970, pp. 291–307
Bultan T., Aykanat C.: A New Mapping Heuristic Based on Mean Field Annealing, J. Parallel Distrib. Comput., 1995, vol 16, pp. 452–469
Nelson, M., et al.: NAMD: A Parallel Object-Oriented Molecular Dynamics Program, Intn. Journal of Supercomputing Applications and High Performance Computing, Volume 10, No. 4, 1996., pp. 251–268
Sadayappan, P., Ercal., F.: Nearest-Neighbour Mapping of Finite Element Graphs onto Processor Meshes, IEEE Trans. on Computers, Vol. C-36, No 12, 1987, pp. 1408–1424
Pilkington, J.R, Baden, S.B.: Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves, IEEE Trans. on Parallel and Distributed Sys. 1997, Volume 7, pp. 288–300
Heiss, H., Dormanns, M.: Task Assignment by Self-Organizing Maps Interner Bericht Nr.17/93, Mai 1993 Universität Karlsruhe, Fakultät für Informatik
Quittek, J.W., Optimizing Parallel Program Execution by Self-Organizing Maps, Journal of Artificial Neural Networks, Vol. 2, No. 4, 1995, pp. 365–380
Atun, M.: A New Load Balancing Heuristic Using Self-Organizing Maps, M.Sc Thesis, Computer Eng. Dept., Bilkent University, Ankara, Turkey, 1999
University of Paderborn, AG-Monien Home Page (Parallel Computing Group), http://www.uni-paderborn.de/fachbereich/AG/monien.
Karypis., G, Kumar. V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, TR 95-035, Department of Computer Science, University of Minesota, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gürsoy, A., Atun, M. (2000). Neighbourhood Preserving Load Balancing: A Self-Organizing Approach. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_32
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive