✦ LIBER ✦

A message-routing strategy for multicomputer systems

✍ Scribed by Hyeong-Ah Choi; Abdol-Hossein Esfahanian

Publisher: John Wiley and Sons
Year: 1992
Tongue: English
Weight: 922 KB
Volume: 22
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230220703

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A deadlock prevention strategy for adapt

A deadlock prevention strategy for adaptive routing systems

✍ Antonio Corradi; Cesare Stefanelli 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 559 KB

A Communication Architecture for a Massi

A Communication Architecture for a Massively Parallel Message-Passing Multicomputer

✍ C. Germain; J.L. Bechennec; D. Etiemble; J.P. Sansonnet 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 916 KB

Communication networks stress the distinction between classical and massively parallel architectures. The network is the key for the whole architecture efficiency, while severe technological constraints limit the possible choices. This paper presents forced routing, which is the routing strategy of

Path Selection for Message Passing in a

Path Selection for Message Passing in a Circuit-Switched Multicomputer

✍ Sunggu Lee; Jong Kim 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 297 KB

may be performed at an intermediate node as soon as the header of the message arrives with the destination information. Thus, with cut-through, only an on-line flit buffer is required to examine the message header at each intermediate node. If cut-throughs are established through all intermediate no

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

Optimal Routing Algorithms for a Class o

Optimal Routing Algorithms for a Class of Cylindrical Banyan Multicomputers

✍ N.S. Woo; B. Naylor 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 538 KB

The cylindrical banyan network is a variation of the classical banyan network in two ways: (1) each node is a processor with a switch, and (2) every pair of nodes at the two ends is merged. We present a routing algorithm for the cylindrical banyan network, and show it is optimal in terms of the path