Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

@article{Dally1987DeadlockFreeMR,
  title={Deadlock-Free Message Routing in Multiprocessor Interconnection Networks},
  author={William J. Dally and Charles L. Seitz},
  journal={IEEE Transactions on Computers},
  year={1987},
  volume={C-36},
  pages={547-553}
}
  • W. Dally, C. Seitz
  • Published 1 May 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… 
Deadlock-free message routing in multicomputer networks
TLDR
This paper formalizes the concept of message routing and shows a method by which a deadlock-free routing algorithm can be constructed out of a given routing algorithm.
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
TLDR
Two deadlock-free adaptive routing algorithms are described that allocate virtual channels using a count of the number of dimension reversals a packet has performed to eliminate cycles in resource dependency graphs and improve virtual channel utilization.
Load balanced deadlock-free deterministic routing of arbitrary networks
TLDR
An algorithm is presented which will evenly map virtual links onto the routed network so that it will be deadlock-free using the minimum number of buffer classes per physical link, thus maximising the buffer size per virtual link.
Efficient Deadlock-Free Multi-dimensional Interval Routing in Interconnection Networks
TLDR
The issue of a simultaneous reduction of the compactness and the size is fundamental, worth to investigate and of practical importance, as interval routing and wormhole routing have been realized in INMOS Transputer C104 Router chips.
Generic methodologies for deadlock-free routing
TLDR
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network and shows that the methodology can be applied to store-and-forward and virtual cut-through routings as well.
A Sufficient Condition for Deadlock-Free Adaptive Routing in Mesh Networks
TLDR
It is proved that the proposed flow control algorithm is a sufficient condition for deadlock freedom in any minimal path, adaptive routing algorithms on k-ary, n-cube mesh network.
Deadlock-Free Routing in k-Ary Hypercube Network in Presence of Processor Failures
Abstract This paper presents deadlock-free algorithms for message routing in a k-ary hypercube network even when some of the nodes in the network have failed. The idea of virtual communication
A Deadlock Free Routing Algorithm with Network Size Independent Buffering Space
TLDR
A new deadlock free routing function which avoids the drawbacks of existing methods based on buffers ordering is proposed which is based on a protocol which insures the correct delivery of messages at their destination in networks of even degree.
A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks
TLDR
A generic methodology for defining deadlock-free wormhole routing schemes in any arbitrary network by partitioning a graph into subdigraphs with no cyclic dependencies and selectively assign virtual channels is introduced.
On Deadlocks In Interconnection Networks
TLDR
It is empirically show that increasing routing freedom, as achieved by allowing unrestricted routing over multiple virtual channels, makes deadlocks highly improbable and reduces the likelihood of other types of correlated message blocking behavior that can degrade performance.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 20 REFERENCES
Deadlock- and livelock-free packet switching networks
TLDR
This work presents a local controller which is proved to be deadlock- and livelock-free, and guarantees that every packet in the network reaches its destination within a finite amount of time.
Deadlock Avoidance in Store-and-Forward Networks - I: Store-and-Forward Deadlock
TLDR
The proposed deadlock avoidance mechanism works for any network topology and any finite routing algorithm and increases the efficiency of buffer use.
A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks
  • D. Gelernter
  • Computer Science
    IEEE Transactions on Computers
  • 1981
TLDR
It is argued that these costs are imposed infrequently enough and are sufficiently well manageable by heuristic techniques to make this new algorithm an attractive and practical alternative to the older techniques.
Prevention of Deadlocks in Packet-Switched Data Transport Systems
TLDR
In this paper, necessary and sufficient conditions are given and proven for the use of process ordering and generalized resource ordering techniques to avoid deadlocks in arbitrary systems of interacting processes.
The cube-connected-cycles: A versatile network for parallel computation
TLDR
This work describes in detail how to program the cube-connected-cycles for efficiently solving a large class of problems, which includes Fast-Fourier-Transform, sorting, permutations, and derived algorithms, and the CCC can also be used as a general purpose parallel processor.
The cube-connected cycles: a versatile network for parallel computation
TLDR
This work describes in detail how to program the cube-connected cycles for efficiently solving a large class of problems that include Fast Fourier transform, sorting, permutations, and derived algorithms.
Deadlock-Free Packet Switching Networks
TLDR
This research presents a novel approach to designing and testing flow control procedures (controllers) that are deadlock-free on the basis of known deadlock states and show high levels of efficiency.
On the Performance of k-ary n-cube Interconnection Networks
TLDR
Low-dimensional k-ary n-cube networks (e.g., tori) have lower latency and higher hot-spot throughput than high-dimensional networks with the same bisection width.
Virtual Cut-Through: A New Computer Communication Switching Technique
TLDR
The analysis shows that cut-through switching is superior (and at worst identical) to message switching with respect to the above three performance measures.
The extension of object-oriented languages to a homogeneous, concurrent architecture
TLDR
Techniques are developed which permit the execution of general purpose object oriented programs on a homogeneous machine and a distributed, on-the-fly garbage collection algorithm is presented which operates by message passing.
...
1
2
...