Deadlock Free Message Routing in Multiprocessor Interconnection Networks

Dally, William J. and Seitz, Charles L. (1986) Deadlock Free Message Routing in Multiprocessor Interconnection Networks. Technical Report. California Institute of Technology. [CaltechCSTR:1986.5206-tr-86]

Full text available as:

Other (Adobe PDF (1.2MB))

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 deadlockfree routing is the absence of cycles in the 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.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	295
Deposited By:	Caltech Library System
Deposited On:	30 November 2001
Record Number:	CaltechCSTR:1986.5206-tr-86
Official Persistent URL:	http://resolver.caltech.edu/CaltechCSTR:1986.5206-tr-86
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record