direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications of KBS

Task Assignment by Self-Organizing Maps
Citation key HD93
Author Hans-Ulrich Heiss and Marcus Dormanns
Title of Book Internal Report No. 17/93, Dep. of Computer Science, University of Karlsruhe
Year 1993
Month may
Abstract To execute a parallel program on a multicomputer system, the tasks of the program have to be mapped to the particular processors of the parallel machine. To keep communication delays low, communicating tasks should be placed closely together. Since both the communication structure of the program and the interconnection structure of the parallel machine can be represented as graphs, the mapping problem can be regarded as a graph embedding problem to minimize communication costs. As a heuristic approach to this NP-hard problem we apply Kohonen's self-organizing maps to establish a topology-preserving embedding. Besides injective (one-toone) mappigs we mainly consider contractive (many-to-one) assignments, where in addition the load balancing problem has to be solved. Results from simulation experiments are presented and compared to other approaches to this problem.
Link to publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe