Deadlock-free interval routing schemes

DOI10.1007/BFB0023472MaRDI QIDQ5048937zbMATH OpenOpenAlexFDO

Authors Michele Flammini

Publication date 9 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0023472

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1340884
• scientific article; zbMATH DE number 2206367
• A survey on interval routing
• Multidimensional interval routing schemes
• Interval routing schemes

Cites work

• scientific article; zbMATH DE number 3940741 (Why is no real title available?)
• scientific article; zbMATH DE number 4085576 (Why is no real title available?)
• scientific article; zbMATH DE number 732976 (Why is no real title available?)
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Designing networks with compact routing tables
• Interval Routing
• Interval routing schemes
• Labelling and Implicit Routing in Networks
• Requirements for deadlock-free, adaptive packet routing
• The complexity of interval routing on random graphs

Cited in

(6)

• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• scientific article; zbMATH DE number 2206367 (Why is no real title available?)
• A survey on interval routing
• Interval routing in some planar networks.
• Deadlock-free message routing in multicomputer networks
• scientific article; zbMATH DE number 749818 (Why is no real title available?)

This page was built for publication: Deadlock-free interval routing schemes

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