scispace - formally typeset
Open AccessJournal ArticleDOI

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

Reads0
Chats0
TLDR
In this article, a deadlock-free routing algorithm for arbitrary interconnection networks using the concept of virtual channels is presented, where the necessary and sufficient condition for deadlock free routing is the absence of cycles in a channel dependency graph.
Abstract
A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into groups of virtual channels. This method is used to develop deadlock-free routing algorithms for k-ary n-cubes, for cube-connected cycles, and for shuffle-exchange networks.

read more

Content maybe subject to copyright    Report






Citations
More filters
Book

Principles and Practices of Interconnection Networks

TL;DR: This book offers a detailed and comprehensive presentation of the basic principles of interconnection network design, clearly illustrating them with numerous examples, chapter exercises, and case studies, allowing a designer to see all the steps of the process from abstract design to concrete implementation.
Journal Article

Optical burst switching (OBS) - a new paradigm for an optical Internet

TL;DR: The general concept of OBS protocols and in particular, those based on Just-Enough-Time (JET), is described, along with the applicability ofOBS protocols to IP over WDM, and the performance of JET-based OBS Protocols is evaluated.
Journal ArticleDOI

A survey of research and practices of Network-on-chip

TL;DR: The research shows that NoC constitutes a unification of current trends of intrachip communication rather than an explicit new alternative.
Book

Parallel Computer Architecture: A Hardware/Software Approach

TL;DR: This book explains the forces behind this convergence of shared-memory, message-passing, data parallel, and data-driven computing architectures and provides comprehensive discussions of parallel programming for high performance and of workload-driven evaluation, based on understanding hardware-software interactions.
Journal ArticleDOI

A survey of wormhole routing techniques in direct networks

TL;DR: The properties of direct networks are reviewed, and the operation and characteristics of wormhole routing are discussed in detail, along with a technique that allows multiple virtual channels to share the same physical channel.
References
More filters
Journal ArticleDOI

Parallel Processing with the Perfect Shuffle

TL;DR: Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to aperfect shuffle of a deck of cards.
Journal ArticleDOI

The cosmic cube

TL;DR: Cosmic Cube as discussed by the authors is a hardware simulation of a future VLSI implementation that will consist of single-chip nodes, which offers high degrees of concurrency in applications and suggests that future machines with thousands of nodes are both feasible and attractive.
Journal ArticleDOI

Virtual cut-through: A new computer communication switching technique

TL;DR: The analysis shows that cut-through switching is superior (and at worst identical) to message switching with respect to the above three performance measures.
Journal ArticleDOI

The Torus Routing Chip

TL;DR: The torus routing chip (TRC) is a selftimed chip that performs deadlock-free cut-through routing ink-aryn-cube multiprocessor interconnection networks using a new method of deadlock avoidance called virtual channels.
Journal ArticleDOI

A large scale, homogeneous, fully distributed parallel machine, I

TL;DR: The preliminary hardware description of CHOPP (Columbia Homogeneous Parallel Processor), a MIMD machine supporting a fully distributed host-less operating system is presented.