Efficient deadlock-free multi-dimensional interval routing in interconnection networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1499, Issue , 1998, Pages 273-287

  Kráĭovič, Rastislav ^a   Rovan, Branislav ^a   Ružička, Peter ^a   Štefankovič, Daniel ^a  

^a Physics and Informatics   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; GEOMETRY; GRAPH THEORY; INTEGRATED CIRCUIT INTERCONNECTS; ROUTERS; ROUTING PROTOCOLS;

ACYCLIC ORIENTATION; CUBE-CONNECTED CYCLES; INTERVAL ROUTING; MULTI DIMENSIONAL; PACKET ROUTING; PRACTICAL IMPORTANCE; SIMULTANEOUS REDUCTION; WORMHOLE ROUTING;

NETWORK ROUTING;

EID: 84947940183     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. E. Bakker, J. van Leeuwen, R.B. Tan: Linear interval routing schemes. Algorithms Review 2, 1991, pp. 45-61.
2. R. Cypher, L. Gravano: Requirements for Deadlock-Free, Adaptive Packet Routing. In 14th Annual ACM Symposium on Principles of Distributed Computing (PODC), 1992, pp. 25-33.
3. W.J. Dally, C.L. Seitz: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36, 1987, pp. 547-553.
4. M. Flammini: Deadlock-Free Interval Routing Schemes. In 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 1200, Springer-Verlag, 1997, pp. 351-362.
5. M. Flammini, G. Gambosi, U. Nanni, R. Tan: Multi-Dimensional Interval Routing Schemes. In 9th International Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science, Springer-Verlag, 1995. To appear in Theoretical Computer Science.
6. C. Gavoille: A Survey on Interval Routing Schemes. Research Report RR-1182-97, LaBRI, Université Bordeaux I, October 1997. Submitted for publication.
7. R. KràĬovič, P. Ružička, D. Štefankovič: The Complexity of Shortest Path and Dilation Bounded Interval Routing. In 3rd International Euro-Par Conference, Lecture Notes in Computer Science 1300, Springer-Verlag, August 1997, pp. 258-265. Full version will appear in Theoretical Computer Science.
8. P.M. Merlin, P.J. Schweitzer: Deadlock avoidance in store-and-forward networks. IEEE Transactions of Communications, COM-27, 1980, pp. 345-360.
9. P. Ružička, D. Štefankovič: On the Complexity of Multi-Dimensional Interval Routing Schemes. Submitted for publication.
10. I. Sakko, L. Mugwaneza, Y. Langue: Routing with compact tables. Applications in Parallel and Distributed Computing (APDC), North-Holland, 1994.
11. G. Tel: Introduction to Distributed Algorithms. (Chapter 5: Deadlock-free Packet Routing). Cambridge University Press, Cambridge, U.K., 1994.
12. S. Toueg: Deadlock-free and livelock-free packet switching networks. In Proceedings of Symposium on Theory of Computing (STOCS), 1980, pp. 94-99.
13. S. Toueg, J. Ullman: Deadlock-free packet switching networks. SIAM Journal of Computing 10, 1981, pp. 594-611.
14. J. van Leeuwen, R.B. Tan: Compact routing methods: A survey. In 1st International Colloquium on Structural Information and Communication Complexity (SIROCCO), Carleton Press, 1994, pp. 99-110.
15. J. Vounckx, G. Deconinck, R. Lauwereins, J.A. Peperstraete: Deadlock-free Fault Tolerant Wormhole Routing in Mesh-Based Massively Parallel Systems. In Technical Committee on Computer Architecture (TCCA) Newsletter, IEEE Computer Society, Summer-Fall issue, 1994, pp. 49-54.
16. J. Vounckx, G. Deconinck, R. Cuyvers, R. Lauwereins: Minimal Deadlock.free Compact Routing in Wormhole-Switching based Injured Meshes. In Proceedings of the 2nd Reconfigurable Architectures Workshop, Santa Barbora, Ca, 1995.