Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Minimal routing in reconfigurable communication networks

: Rosner, S.; Danz, S.; Scholles, M.

European Association for Microprocessing and Microprogramming:
Second International Conference on Massively Parallel Computing Systems 1996. Proceedings
Los Alamitos, Calif.: IEEE Computer Society Press, 1996
ISBN: 0-8186-7600-0
ISBN: 0-8186-7602-7
International Conference on Massively Parallel Computing Systems (MPCS) <2, 1996, Ischia>
Fraunhofer IMS, Außenstelle Dresden ( IPMS) ()
Adressierung; Blockierung; routing; Speicherschema; Topologie

The 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.