scientific article; zbMATH DE number 1156659

MaRDI QIDQ4390696zbMATH OpenFDO

Authors Chunlin Yang, Jie Wu

Publication date 8 September 1998

zbMATH Keywords

interconnection networksrouting algorithmtorus networktrail-based model

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A foundation for designing deadlock-free routing algorithms in wormhole networks
• Deadlock-free oblivious wormhole routing with cyclic dependencies

Cited in

(8)

• Optimal routing in toroidal networks
• Routing performance enhancement in hierarchical torus network by link-selection algorithm
• A foundation for designing deadlock-free routing algorithms in wormhole networks
• A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes
• An intensive analysis and comparison of three deadlock-free multicast algorithms in 2D torus multicomputers
• The multi-level communication: Efficient routing for interconnection networks
• A generic design methodology for deadlock-free routing in multicomputer networks
• A general methodology for direction-based irregular routing algorithms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4390696)