Characterization of Deadlocks in Interconnection Networks

  title={Characterization of Deadlocks in Interconnection Networks},
  author={Sugath Warnakulasuriya and Timothy Mark Pinkston},
Deadlock-free routing algorithms have been developed recently without fully understanding the frequency and characteristics of deadlocks. Using a simulator capable of true deadlock detection, we measure a network's susceptibility to deadlock due to various design parameters. The effects of bidirectionality, routing adaptivity, virtual channels, buffer size and node degree on deadlock formation are studied. In the process, we provide insight into the frequency and characteristics of deadlocks… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
17 Citations
15 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 17 extracted citations


Publications referenced by this paper.
Showing 1-10 of 15 references

Jayasimha, “A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing

  • D. N. Loren Schwiebert
  • Journal of Parallel and Distributed Computing
  • 1996
2 Excerpts

The SP2 high-performance switch

  • C. B. Stunkle
  • IBM Systems Journal,
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…