Interval routing is a space-efficient routing method for point-to-point communication networks. The method has drawn considerable attention in recent years because of its being incorporated into the design of a commercially available routing chip. The method is based on proper labeling of edges of t
A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks
โ Scribed by Hyunmin Park; Dharma P. Agrawal
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 372 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
โฆ Synopsis
This paper introduces a generic methodology for defining deadlock-free wormhole routing schemes in any arbitrary network. The basic strategy is to partition a graph into subdigraphs with no cyclic dependencies and selectively assign virtual channels. The usefulness of our scheme is shown for the n-dimensional hypercube, the n-dimensional mesh, and the k-ary n-cube torus by identifying subdigraph characteristics that ensure acyclic routing. Further generalization which allows partial cyclic dependencies without deadlock is achieved by our extended generic methodology. We also illustrate how to identify shortest fixed path and nonminimal adaptive routing schemes using minimum required channels.
๐ SIMILAR VOLUMES
Design, Reactivities, and Practical Application of Dialkylzinc Hydride Ate Complexes Generated in situ from Dialkylzinc and Metal Hydride. A New Methodology for Activation of NaH and LiH under Mild Conditions. -The study on the reactivities of dialkylzinc hydride ate complexes toward carbonyl compou