
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ran LibeskindHadas, Nimish Shrivastava, Rami G. Melhem, C. L. Liu, "Optimal Reconfiguration Algorithms for RealTime FaultTolerant Processor Arrays," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 5, pp. 498511, May, 1995.  
BibTex  x  
@article{ 10.1109/71.382318, author = {Ran LibeskindHadas and Nimish Shrivastava and Rami G. Melhem and C. L. Liu}, title = {Optimal Reconfiguration Algorithms for RealTime FaultTolerant Processor Arrays}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {5}, issn = {10459219}, year = {1995}, pages = {498511}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.382318}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Optimal Reconfiguration Algorithms for RealTime FaultTolerant Processor Arrays IS  5 SN  10459219 SP498 EP511 EPD  498511 A1  Ran LibeskindHadas, A1  Nimish Shrivastava, A1  Rami G. Melhem, A1  C. L. Liu, PY  1995 VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Several new results are given for this problem. Efficient reconfiguration algorithms are described for a number of general classes of architectures. These general algorithms obviate the need for architecturespecific algorithms for architectures in these classes. We show that it is unlikely that similar algorithms can be obtained for related classes of architectures since the reconfiguration problem for these classes is NPcomplete. Finally, a general approximation algorithm is described that can be used for any architecture. Experimental results are given, suggesting that our algorithms are very effective.
[1] P. Banerjee,“Strategies for reconfiguring hypercubes under faults,”inProc. 20th Int. Symp. FaultTolerant Comput., June 1990, pp. 210–215.
[2] M. Chean and J. A. B. Fortes,“A taxonomy of reconfiguration techniques for faulttolerant processor arrays,”IEEE Comput., vol. 23, pp. 55–69, Jan. 1990.
[3] C. Chen, A. Feng, T. Kikuno, and K. Torii,“Reconfiguration algorithm for faulttolerant arrays with minimum number of dangerous processors,”inProc. 21st Int. Symp. FaultTolerant Comput., 1991, pp. 452–459.
[4] M. Davis and H. Putnam, "A Computing Procedure for Quantification Theory," J. ACM, vol. 7, July 1960, pp. 201215.
[5] S. Even, A. Itai, and A. Shamir,“On the complexity of timetable and multicommodity flow problems,”SIAM J. Comput., vol. 5, pp. 691–703, 1976.
[6] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[7] A.S.M. Hassan and V.K. Argawal, "A FaultTolerant Modular Architecture for Binary Trees," IEEE Trans. Computers, Vol. C35, Apr. 1986, pp. 356361.
[8] B. Kim and D. Towsley,“Dynamic flow control protocols for packetswitching multiplexers serving realtime multipacket messages,”IEEE Trans. Commun., vol. COM34, Apr. 1986.
[9] R. LibeskindHadas,“Reconfiguration of faulttolerant VLSI systems,”Dep. of Comput. Sci., Univ. of Illinois at UrbanaChampaign, Tech. Rep. UIUCDCSR931824, July 1993.
[10] F. Lombardi, R. Negrini, M. G. Sami and R. Stefanelli,“Reconfiguration of VLSI arrays: A covering approach,”inProc. 17th Int. Symp. FaultTolerant Comput., 1987, pp. 251–256.
[11] R. G. Melhem,“Bilevel reconfigurations of fault tolerant arrays,”IEEE Trans. Comput., vol. 41, pp. 231–239, Feb. 1992.
[12] K. Mehlhorn, Graph Algorithms and NPCompleteness.Berlin: SpringerVerlag, 1984.
[13] R. Negrini, M. G. Sami, and R. Stefanelli,Fault Tolerance Through Reconfiguration in VLSI and WSI Arrays. Cambridge, MA: The M.I.T. Press, 1989.
[14] C. S. Raghavendra, A. Avizienis, and M. Ercegovac,“Fault tolerance in binary tree architectures,”IEEE Trans. Comput., vol. C33, pp. 568–572, June 1984.
[15] D. A. Rennels,“On implementing faulttolerance in binary hypercubes,”Proc. 16th Int. Symp. FaultTolerant Comput., 1986, pp. 344–349.
[16] C. Savage,“Maximum matchings and trees,”Inform. Processing Lett., vol. 10, nos. 4, 5, pp. 202–205, July 5, 1980.
[17] N. Shrivastava and R. G. Melhem,“Efficient and optimal faulttospare assignments in doubly fault tolerant arrays,”inProc. IEEE Int. Workshop on Defect and Fault Tolerance in VLSI Syst., Nov. 1991, pp. 247–259.
[18] A. D. Singh,“A reconfigurable modular fault tolerant binary tree architecture,”inProc. 17th Int. Symp. FaultTolerant Comput., 1987, pp. 298–304.
[19] ——,“Interstitial redundancy: An area efficient fault tolerance scheme for large area VLSI processor arrays,”IEEE Trans. Comput., vol. 37, pp. 1398–1410, Nov. 1988.
[20] R. Tarjan, "Data Structures and Network Algorithms," SIAM,Philadelphia, Penn., 1983.
[21] M. W. Yung, M. J. Little, R. D. Etchells, and J. G. Nash,“Redundancy for yield enhancement in the 3D computer,”inProc. 1989 IEEE Int. Conf. on Wafer Scale Integr., 1989, pp. 73–82.