A Solution for the Processor Allocation Problem: Topology Conserving Graph Mapping by Self-Organization
We consider the problem of how to allocate the tasks of a parallel program to the processor elements of a multicomputer system such that the communication overhead of the program is minimized. This problem basically amounts to a graph embedding problem since both the program and the multicomputer can be modeled as graphs. The embedding problem can be characterized as the search for a topology conserving mapping of the source graph to the target graph.
To find such mappings we apply the Kohonen selforganization process. Our main concern in this article is to show how this graph embedding problem can be fitted to the Kohonen technique. To that end, we introduce feature vectors for each node of the source graph to provide topological information exceeding direct neighborhood and considering larger surroundings.
The particular optimization goal of the task mapping problem is being related to known results of the Kohonen process. The behavior and performance of our approach is illustrated by some sample graphs.
KeywordsFeature Vector Communication Cost Parallel Program Topological Information Target Graph
Unable to display preview. Download preview PDF.
- Heiss H-U, ‘Classification of Problems and Algorithms for Processor Allocation in Parallel Systems’, Internal Report 7/91, University of Karlsruhe, 1991.Google Scholar
- Neuhaus P, ‘Solving the Mapping-Problem — Experiences with a Genetic Algorithm’, Parallel Problem Solving from Nature 1990, Proceedings, Springer LNCS 496, pp. 170-175.Google Scholar
- Mühlenbein H, Gorges-Schleuter M and Krämer O, ‘New solutions to the mapping problem of parallel systems: The evolution approach’, Parallel Computing 4, pp. 269–279, 1987.Google Scholar
- Ritter H, Martinetz T and Schulten K, ‘Neural Networks’, Addison Wesley 1991.Google Scholar