Rosner, S.S.RosnerDanz, S.S.DanzScholles, M.M.Scholles2022-03-092022-03-091996https://publica.fraunhofer.de/handle/publica/326559The data throughput of communication networks of MIMD computers increases if only local communication can be achieved. Hence, adapting the network topology to the application and using a flexible routing algorithm promises improved performance. Different routing algorithms for ATM-networks and MIMD computers have been investigated. In result a topology-independent routing criterion has been found and implemented into a minimal routing algorithm. The routing problem is split into a topology-dependent addressing problem, which needs to be solved once for every topology, and into a topology-independent evaluation of addresses allowing a direct VLSI-implementation. Experiments demonstrate the applicability of the routing algorithm to topologies of varying connectivity and regularity and different buffering styles.enAdressierungBlockierungroutingSpeicherschemaTopologie621Minimal routing in reconfigurable communication networksconference paper