𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A deadlock prevention strategy for adaptive routing systems

✍ Scribed by Antonio Corradi; Cesare Stefanelli

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
559 KB
Volume
20
Category
Article
ISSN
0141-9331

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A multiple-path routing strategy for veh
A multiple-path routing strategy for vehicle route guidance systems
✍ Chi-Kang Lee πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 855 KB

This paper analyzes the transportation effectiveness of a multiple-path routing strategy using traffic simulation from the perspective of planning and designing a vehicle route guidance system. The test results indicate that the multiple-path routing strategy performs better than the commonly used s

A Necessary and Sufficient Condition for
A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing
✍ Loren Schwiebert; D.N. Jayasimha πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 341 KB

An important open problem in wormhole routing has been to find a necessary and sufficient condition for deadlock-free adaptive routing. Recently, Duato has solved this problem for a restricted class of adaptive routing algorithms. In this paper, a necessary and sufficient condition is proposed that

Route adaptation of control strategies f
Route adaptation of control strategies for a hybrid city bus
✍ Jan Andersson; Roger Axelsson; Bengt Jacobson πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 681 KB

A series hybrid city bus with diesel engine and electric batteries is studied on a speci"ed route. The study uses two di!erent basic control strategies, `On/o!a and `Continuousa strategy. These basic strategies are complemented in two ways. First, an `Advisera strategy which "lters the driver comman

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