This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reconfigurable Multipipelines for Vector Supercomputers
September 1989 (vol. 38 no. 9)
pp. 1297-1307
The problem of recovering multipipelines in the presence of faulty stages is addressed. The stages are assumed to be organized in rows and columns. The pipeline stages are alternated with reconfiguring circuitry which is used for bypassing the faulty stages. The pipelines are configured by programming the switches in a distributed manner using fault information available locally. The configurat

[1] A. L. Rosenberg, "The Diogenes approach to testable fault-tolerant networks of processors,"IEEE Trans. Comput., vol. C-33, pp. 902- 910, Oct. 1983.
[2] D. Fussel and P. Varman, "Fault-tolerant wafer-scale architectures for VLSI," inProc. 9th Annu. Symp. Comput. Architecture, May 1982.
[3] F. B. Manning, "An approach to highly integrated, computermaintained cellular arrays,"IEEE Trans. Comput., vol. C-26, pp. 536-552, June 1977.
[4] M. Speicher, "Grid-embedding--A reconfiguration method for cellular arrays," inSelf-Diagnosis and Fault-Tolerance. Werkhefte der Universitat, Tubingen, Nr. 4, Attempto-Verlag Tubingen. Tubingen, F.R. Germany: Tubingen University Press, 1981, pp. 244-259.
[5] W. J. Greene and A. Gamal, "Area and delay penalties in restructurable wafer-scale arrays," inProc. 3rd Caltech Conf. VLSI, Woodland Hills, CA, Mar. 1984, pp. 165-185.
[6] R. Gupta and A. Zorat, "The design of fault-tolerant communication links for wafer-scale integration," Tech. Rep. 84/093, Dep. Comput. Sci., SUNY, Stony Brook, NY, 1984, presented at 4th DOE Workshop on Computer Aided Design, Brookhaven National Lab., NY, Oct. 1985.
[7] I. Koren, "A reconfigurable and fault-tolerant VLSI multiprocessor array," inProc. 8th Int. Symp. Comput. Architecture, Minneapolis, MN, May 1981, pp. 425-442.
[8] F. T. Leighton and C. E. Leiserson, "Wafer-scale integration of systolic arrays,"IEEE Trans. Comput., vol. C-34, pp. 448-461, May 1985.
[9] C. D. Thompson, "Area-time complexity for VLSI," inProc. Eleventh Annu. ACM Symp. Theory Comput., 1979, pp. 81-88.
[10] W. Feller,An Introduction to Probability Theory and Its Applications, Vol. I. 2nd ed. New York: Wiley, 1971.
[11] J. D. Ullman,Computational Aspects of VLSI. Woodland Hills, CA: Computer Science Press, 1984.
[12] S. Sahni, "Scheduling multipipeline and multiprocessor computers,"IEEE Trans. Comput., vol. C-33, pp. 637-645, July 1984.
[13] J. Hack, "Peak versus sustained performance in highly concurrent vector machines,"IEEE Computer, vol. 19, no. 9, pp. 11-19, Sept. 1986.
[14] P. M. Kogge,The Architecture of Pipelined Computers. New York: McGraw-Hill, 1981.
[15] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
[16] C. J. Terman, "Simulation tools for digital LSI design lab. for computer science," MIT/LCS/TR-304, MIT, Cambridge, Sept. 1983.
[17] L. Nagel, "SPICE2: A computer program to simulate semiconductor circuits," ERL Memo ERL-M520, Univ. of California, Berkeley, May 1975.

Index Terms:
reconfigurable multipipelines; probabilistic bounds; vector supercomputers; rows; columns; reconfiguring circuitry; delay; yield; fault-tolerant buses; fault tolerant computing; parallel processing; pipeline processing.
Citation:
R. Gupta, A. Zorat, I.V. Ramakrishnan, "Reconfigurable Multipipelines for Vector Supercomputers," IEEE Transactions on Computers, vol. 38, no. 9, pp. 1297-1307, Sept. 1989, doi:10.1109/12.29468
Usage of this product signifies your acceptance of the Terms of Use.