Deadlock-free interval routing schemes

DOI10.1007/BFB0023472zbMATH Open1498.68020OpenAlexW1534598974MaRDI QIDQ5048937FDOQ5048937

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

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

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)

Cites Work

• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Designing networks with compact routing tables
• Interval Routing
• Title not available (Why is that?)
• Requirements for deadlock-free, adaptive packet routing
• Labelling and Implicit Routing in Networks
• Interval routing schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity of interval routing on random graphs

Cited In (6)

• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Title not available (Why is that?)
• A survey on interval routing
• Interval routing in some planar networks.
• Deadlock-free message routing in multicomputer networks
• Title not available (Why is that?)

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)