This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th International Parallel Processing Symposium (IPPS '96)
Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent
Honolulu, HI
April 15-April 19
ISBN: 0-8186-7255-2
ASCII Text
x 
 
K.V. Anjan, T.M. Pinkston, J. Duato, "Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent," Parallel Processing Symposium, International, pp. 815, 10th International Parallel Processing Symposium (IPPS '96), 1996.
 
 
BibTex
x
 
@article{ 10.1109/IPPS.1996.508153,
author = {K.V. Anjan and T.M. Pinkston and J. Duato},
title = {Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent},
journal ={Parallel Processing Symposium, International},
volume = {0},
year = {1996},
issn = {1063-7133},
pages = {815},
doi = {http://doi.ieeecomputersociety.org/10.1109/IPPS.1996.508153},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Processing Symposium, International
TI - Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent
SN - 1063-7133
SP
EP
A1 - K.V. Anjan,
A1 - T.M. Pinkston,
A1 - J. Duato,
PY - 1996
KW - concurrency control; system recovery; fault tolerant computing; network routing; multiprocessor interconnection networks; parallel architectures; performance evaluation; deadlock-free adaptive wormhole routing; Disha Concurrent; edge; central buffers; deadlock recovery; sequential recovery; resource cost; mutual exclusive access; deadlock-free lane; Token; Hamiltonian path; k-ary n-cube networks; tree-based networks; multiprocessor interconnection networks
VL - 0
JA - Parallel Processing Symposium, International
ER -
 
K.V. Anjan, Pyramid Technol. Corp., San Jose, CA, USA
T.M. Pinkston, Pyramid Technol. Corp., San Jose, CA, USA
J. Duato, Pyramid Technol. Corp., San Jose, CA, USA
This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-recovery which relaxes the sequential recovery requirement for simultaneous recovery from deadlocks. The proposed extension to Disha does not necessitate any additional resource cost; rather it serves to eliminate the requirement of mutual exclusive access to the deadlock-free lane implemented by a Token. With this extension, Disha Concurrent remains applicable to any topology with a Hamiltonian path including k-ary n-cube networks and is also applicable to tree-based networks.
Index Terms:
concurrency control; system recovery; fault tolerant computing; network routing; multiprocessor interconnection networks; parallel architectures; performance evaluation; deadlock-free adaptive wormhole routing; Disha Concurrent; edge; central buffers; deadlock recovery; sequential recovery; resource cost; mutual exclusive access; deadlock-free lane; Token; Hamiltonian path; k-ary n-cube networks; tree-based networks; multiprocessor interconnection networks
Citation:
K.V. Anjan, T.M. Pinkston, J. Duato, "Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent," ipps, pp.815, 10th International Parallel Processing Symposium (IPPS '96), 1996
Usage of this product signifies your acceptance of the Terms of Use.