
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S. Dutt, J.P. Hayes, "On Designing and Reconfiguring kFaultTolerant Tree Architectures," IEEE Transactions on Computers, vol. 39, no. 4, pp. 490503, April, 1990.  
BibTex  x  
@article{ 10.1109/12.54842, author = {S. Dutt and J.P. Hayes}, title = {On Designing and Reconfiguring kFaultTolerant Tree Architectures}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {4}, issn = {00189340}, year = {1990}, pages = {490503}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.54842}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On Designing and Reconfiguring kFaultTolerant Tree Architectures IS  4 SN  00189340 SP490 EP503 EPD  490503 A1  S. Dutt, A1  J.P. Hayes, PY  1990 KW  designing; reconfiguring kfaulttolerant tree architectures; tree structured multiprocessors; static interconnection network; interprocessor communication links; kFT supergraph; dary trees; node covering; computer architecture; fault tolerant computing; multiprocessing systems; trees (mathematics). VL  39 JA  IEEE Transactions on Computers ER   
A general approach to designing tree structured multiprocessors with optimal or nearoptimal fault tolerance properties is developed. A multiprocessor architecture with a static interconnection network is represented by a graph whose nodes are processors and whose edges are interprocessor communication links. The design of kfaulttolerant (FT) trees for arbitrary k is considered, with the primary goal of minimizing the number of spare nodes and edges. Also presented are strategies for reconfiguring a kFT supergraph of a tree T around faults to obtain a faultfree tree isomorphic to T. A systematic methodology is presented for designing kFT nonhomogeneous symmetry dary trees based on a concept termed node covering. The designs are shown to be optimal when k>d and nearoptimal otherwise. It is also shown that these kFT designs can be implemented efficiently using switches to share redundant links.
[1] H. F. Li and C. C. Lau, "A distributed multiprocessor traffic control system," inProc. COMPSAC 78, Nov. 1978, pp. 259264.
[2] E. Horowitz and A. Zorat, "The binary tree as an interconnection network: Applications to multiprocessor systems and VLSI,"IEEE Trans. Comput., pp. 247253, Apr. 1981.
[3] J. Bentley and H. T. Kung, "A tree machine for searching problems," inProc. IEEE 1979 Int. Conf. Parallel Processing, Aug. 1979.
[4] A. M. Despain and D. A. Patterson, "Xtree: A tree structured multiprocessor computer architecture," inProc. Fifth Int. Symp. Comput. Architecture, Apr. 1978, pp. 144151.Comput. Architecture, pp. 2128, Dec. 1973.
[5] J. P. Hayes, "A graph model for fault tolerant computing systems,"IEEE Trans. Comput., pp. 875883, Sept. 1976.
[6] C. L. Kwan and S. Toida, "An optimal 2fault tolerant realization of symmetric hierarchical tree systems,"Networks, vol. 12, pp. 231239, 1982.
[7] C. L. Kwan, "Dynamically optimal faulttolerant structures of hierarchical tree systems," Ph.D. dissertation, Univ. of Waterloo, Waterloo, Ont., Canada, 1981.
[8] C. S. Raghavendra, A. Avizienis, and M. D. Ercegovac, "Fault tolerance in binary tree architectures,"IEEE Trans. Comput., pp. 568572, June 1984.
[9] A. S. M. Hassan and V. K. Agarwal, "A modular approach to faulttolerant modular tree architectures," inProc. Fifteenth Fault Tolerant Comput. Symp., June 1985, pp. 344349.
[10] M. B. Lowrie and W. K. Fuchs, "Reconfigurable tree architectures using subtree oriented fault tolerance,"IEEE Trans. Comput., vol. C36, pp. 11721182, Oct. 1987.
[11] S. Dutt and J. P. Hayes, "Design and reconfiguration strategies for nearoptimal faulttolerant tree architectures," inProc. Eighteenth Fault Tolerant Comput. Symp., June 1988, pp. 328333.
[12] R. M. Yanney and J. P. Hayes, "Distributed fault recovery in multiprocessor networks,"IEEE Trans. Comput., pp. 871879, Oct. 1986.
[13] R. A. Brualdi,Introductory Combinatorics. New York: North Holland, 1977, pp. 155158.
[14] I. Koren, "Comments on 'The Diogenes approach to testable faulttolerant arrays of processors,'"IEEE Trans. Comput., pp. 9394, Jan. 1986.