scientific article; zbMATH DE number 2206367

MaRDI QIDQ5317672zbMATH OpenFDO

Authors Rastislav Královič, Branislav Rovan, Peter Ružička, D. Štefankovič

Publication date 19 September 2005

zbMATH Keywords

deadlock avoidanceinterconnectioninterval routingpacket routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Deadlock-free interval routing schemes
• scientific article; zbMATH DE number 1340884
• Minimum deadlock-free message routing restrictions in binary hypercubes
• A generic design methodology for deadlock-free routing in multicomputer networks
• scientific article; zbMATH DE number 749818

Cited in

(11)

• Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
• Minimum deadlock-free message routing restrictions in binary hypercubes
• A survey on interval routing
• scientific article; zbMATH DE number 1340884 (Why is no real title available?)
• A conflict sense routing protocol and its performance for hypercubes
• Low-congested interval routing schemes for hypercubelike networks
• Deadlock-free interval routing schemes
• A High-Performance Deadlock-Free Multicast Routing Algorithm for K-Ary N-Cubes
• The multi-level communication: Efficient routing for interconnection networks
• A generic design methodology for deadlock-free routing in multicomputer networks
• Deadlock-free routing in k-ary hypercube network in presence of processor failures

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 Q5317672)