Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

  title={Deadlock-Free Message Routing in Multiprocessor Interconnection Networks},
  author={W. Dally and C. Seitz},
  journal={IEEE Transactions on Computers},
  • W. Dally, C. Seitz
  • Published 1987
  • Computer Science
  • IEEE Transactions on Computers
  • A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into groups of virtual channels. This method is used to develop deadlock-free routing algorithms for k-ary n… CONTINUE READING
    2,282 Citations

    Figures and Topics from this paper

    Deadlock-free message routing in multicomputer networks
    • 3
    Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
    • W. Dally, H. Aoki
    • Computer Science
    • IEEE Trans. Parallel Distributed Syst.
    • 1993
    • 560
    • PDF
    Generic methodologies for deadlock-free routing
    • H. Park, D. Agrawal
    • Computer Science
    • Proceedings of International Conference on Parallel Processing
    • 1996
    • 13
    • Highly Influenced
    A Sufficient Condition for Deadlock-Free Adaptive Routing in Mesh Networks
    • 5
    A Deadlock Free Routing Algorithm with Network Size Independent Buffering Space
    • 12
    A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks
    • 3
    • Highly Influenced
    On Deadlocks In Interconnection Networks
    • 56


    Deadlock- and livelock-free packet switching networks
    • 42
    Deadlock Avoidance in Store-and-Forward Networks - I: Store-and-Forward Deadlock
    • 163
    A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks
    • D. Gelernter
    • Computer Science
    • IEEE Transactions on Computers
    • 1981
    • 94
    • PDF
    Prevention of Deadlocks in Packet-Switched Data Transport Systems
    • 187
    The cube-connected-cycles: A versatile network for parallel computation
    • 315
    • PDF
    Deadlock-Free Packet Switching Networks
    • 43
    Virtual Cut-Through: A New Computer Communication Switching Technique
    • 1,016