Generic Methodologies for Deadlock-Free Routing

  title={Generic Methodologies for Deadlock-Free Routing},
  author={Hyunmin Park and Dharma P. Agrawal},
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic dependencies among virtual channels. A novel fully adaptive nonminimal deadlock-free routing algorithm has been developed for k-ary n-cube torus network. Since our technique is based on decomposing a network into several subdigraphs, it simplifies and generalizes the development of both static and adaptive deadlock-free… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…