ACM Home Page
Please provide us with feedback. Feedback
Configurable flow control mechanisms for fault-tolerant routing
Full text PdfPdf (1.14 MB)
Source International Symposium on Computer Architecture archive
Proceedings of the 22nd annual international symposium on Computer architecture table of contents
S. Margherita Ligure, Italy
Pages: 220 - 229  
Year of Publication: 1995
ISBN:0-89791-698-0
Also published in ...
Authors
Binh Vien Dao  Computer Systems Research Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, Georgia
Jose Duato  Facultad de Informatica, Universidad Politecnica de Valencia, P.O.B. 22012, 46071 Valencia, Spain
Sudhakar Yalamanchili  Computer Systems Research Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, Georgia
Sponsors
IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/223982.224433
What is a DOI?

ABSTRACT

Fault-tolerant routing protocols in modern interconnection networks rely heavily on the network flow control mechanisms used. Optimistic flow control mechanisms such as wormhole routing (WR) realize very good performance, but are prone to deadlock in the presence of faults. Conservative flow control mechanisms such as pipelined circuit switching (PCS) insures existence of a path to the destination prior to message transmission, but incurs increased overhead. Existing fault-tolerant routing protocols are designed with one or the other, and must accommodate their associated constraints. This paper proposes the use of configurable flow control mechanisms. Routing protocols can then be designed such that in the vicinity of faults, protocols use a more conservative flow control mechanism, while the majority of messages that traverse fault-free portions of the network utilize a WR like flow control to maximize performance. Such protocols are referred to as two-phase protocols, where routing decisions are provided some control over the operation of the virtual channels. This ability provides new avenues for optimizing message passing performance in the presence of faults. A fully adaptive two-phase protocol is proposed and compared via simulation to those based on WR and PCS. The architecture of a network router supporting configurable flow control is described, and the paper concludes with avenues for future research.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
5
 
6
 
7
 
8
 
9
 
10
 
11
 
12
 
13
 
14
D. Ferrari. Computer Systems Performance Evaluation. Prentice Hall, 1978.
 
15
P. T. Gaughan, B. V. Dao, S. Yalamanchili and D. E. SchimmeI. Distributed deadlock-free routing in faulty pipelined kary n-cubes. Technical Report GIT/CSRL-93/11, Georgia institute of Technology, November 1993
 
16
P.T. Gaughan and S. Yalamanchili. A family of fault-tolerant routing protocols for direct multiprocessor networks. Technical Report GIT/CSRL-93/01, Georgia Institute of Technology, January 1993. To appear in IEEE Transaction on Parallel and Distributed Systems.
 
17
 
18
P. T. Gaughan and S. Yalamanchili. Pipelined circuit switching: A fault-tolerant variant of wormhole routing. Proceedings of IEEE Symposium on Parallel and Distributed Processing, December 1992.
19
 
20
C. J. Glass and L. M. Ni. Fault-tolerant wormhole routing in meshes. Proceedings of the 23rd International Symposium on Fault-Tolerant Computing, pages 240-249, 1L993.
 
21
R. E. Kessler and J. L. Schwarzmeier. Cray T3D: A new dimensions for cray research. Proceedings of the 38th Annual IEEE Computer Society International Computing Conference, 1993.
22
 
23
24


Collaborative Colleagues:
Binh Vien Dao: colleagues
Jose Duato: colleagues
Sudhakar Yalamanchili: colleagues

Peer to Peer - Readers of this Article have also read: