𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization of Deadlocks in Irregular Networks

✍ Scribed by Sugath Warnakulasuriya; Timothy Mark Pinkston

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
240 KB
Volume
62
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

✦ Synopsis

This work characterizes how various network parameters influence message blocking and deadlocks in irregular networks. Information on blocking behavior is provided that is useful in making design trade-offs between restricting routing freedom and allowing the possibility for deadlocks to form in irregular networks. This paper also identifies ways in which a network's susceptibility to deadlock can be reduced and provides guidelines for designing irregular networks that maximize routing flexibility and resource utilization. Finally, a new empirical evaluation methodology for classifying irregular topologies and relating network behavior to various classes of network topologies is introduced.

πŸ“œ 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

Quantitative characterization of polybut
Quantitative characterization of polybutadiene networks
✍ Gerard Kraus πŸ“‚ Article πŸ“… 1963 πŸ› John Wiley and Sons 🌐 English βš– 304 KB

## Abstract Using a relationship found to be applicable for natural rubber networks in establishing contributions of chemical crosslinking, entanglements, and networks defects to physical crosslinking, a physical versus chemical crosslinking β€œcalibration” is developed for polybutadiene prepared by

Characterizing Multiterminal Flow Networ
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth
✍ Torben Hagerup; Jyrki Katajainen; Naomi Nishimura; Prabhakar Ragde πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 417 KB

We show that if a flow network has k inputΓ‚output terminals (for the traditional maximum-flow problem, k=2), its external flow pattern (the possible values of flow into and out of the terminals) has two characterizations of size independent of the total number of vertices: a set of 2 k +1 inequaliti