A Compact Fault-tolerant, Deadlock-free, Minimal Routing Algorithm for n-Dimensional Wormhole Switching Based Meshes - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Johan Vounckx, Geert Deconinck, Rudy Lauwereins. A Compact Fault-tolerant, Deadlock-free, Minimal Routing Algorithm for n-Dimensional Wormhole Switching Based Meshes. In Lefteris M. Kirousis, Christos Kaklamanis, editors, Structure, Information and Communication Complexity, SIROCCO 95, Proceedings of the 2nd Colloquium on Structural Information and Communication Complexity, Olympia Greece, June 12-14, 1995. Volume 2 of Proceedings in Informatics, pages 135-146, Carleton Scientific, 1995.

The following publications are possibly variants of this publication:

Fault-Tolerant Compact Routing Based on Reduced Structural Information in Wormhole-Switching Based NetworksJohan Vounckx, Geert Deconinck, Rudy Lauwereins, J. A. Peperstraete. sirocco 1995: 125-148

runs on WebDSL