This paper deals with load-balancing on a MIMD-computer with processors communicating
only via messages. The approaches presented work for nets with an arbitrary number of
processors. The paper suggests a method which reduces the problem of load-balancing to
a routing problem. This method is specified for loads evenly divisable as well as
grained loads. The computational and the message complexity are extimated.
Inhalt:/ Content: Institut für Informatik
TU Bergakademie Freiberg
Gestaltung/ Layout: Webmaster
19. Februar 1997
