๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Deadlock-free message routing in multicomputer networks

โœ Scribed by Peter A. J. Hilbers; Johan J. Lukkien

Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
803 KB
Volume
3
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Generic Design Methodology for Deadloc
A Generic Design Methodology for Deadlock-Free Routing in Multicomputer Networks
โœ Hyunmin Park; Dharma P. Agrawal ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

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-d

Efficient Deadlock-Free Wormhole Routing
Efficient Deadlock-Free Wormhole Routing and Virtual-Channel Reduction in Shuffle-Based Networks
โœ Hyunmin Park; Dharma P. Agrawal ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 401 KB

Many aspects of shuffle-based networks have recently been studied by numerous researchers. However, no attention has been paid to deadlock-free wormhole routing algorithms. In this paper, for a set of shuffle-based networks, we introduce a graph-partitioning technique that enables a deadlock-free ro