Minimal turn restrictions for designing deadlock-free adaptive routing
Resource
Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on
Journal
Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on
Pages
-
Date Issued
1994-10
Date
1994-10
Author(s)
Lin, Chiu-Chuan
Lin, Ferng-Ching
DOI
N/A
Abstract
A routing algorithm is basically required to be connected and deadlock-free. We can restrict some directions that messages can turn in a network to avoid deadlock. A deadlock-free adaptive routing with fewer turn restrictions is considered to possess a greater degree of adaptiveness. We present two basic strategies for designing feasible routings on networks which have bidirectional channels. Primer investigation of our strategies reveals their ability to obtain minimal turn restrictions on some typical multicomputer networks, like hypercube, mesh and torus.>
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
00346108.pdf
Size
695.05 KB
Format
Adobe PDF
Checksum
(MD5):0bb5f652dc93063b981272ed9d471655