• DocumentCode
    3438670
  • Title

    Reconfiguration strategies in VLSI processor arrays

  • Author

    Belkhale, K.P. ; Banerjee, P.

  • Author_Institution
    Coord. Sci. Lab., Illinois Univ., IL, USA
  • fYear
    1988
  • fDate
    3-5 Oct 1988
  • Firstpage
    418
  • Lastpage
    421
  • Abstract
    Reconfiguration strategies in VLSI processor arrays have been advocated in the recent literature as a means of achieving higher production yield and higher reliability. The authors present reconfiguration techniques for rectangular arrays that are generalizations of the Diogenes approach proposed earlier by A.L. Rosenberg (1983). These techniques overcome many of the limitations of the earlier Diogenes schemes. Two schemes for reconfiguring rectangular arrays are presented. The first scheme for reconfiguring an N×N rectangular array uses r additional rows and c additional columns. It guarantees reconfiguration as long there are at most c columns that have more than r faulty processors. The second scheme uses spare processors. It guarantees reconfiguration as long as there are enough spare processors, and in any window of N processors in a particular linearization there are at most k faulty processors, where k is a parameter of the design
  • Keywords
    VLSI; fault tolerant computing; parallel processing; Diogenes approach; VLSI processor arrays; production yield; reconfiguration strategies; reliability; Degradation; Delay; Fault tolerance; Hardware; Manufacturing processes; Production systems; Switches; Systolic arrays; Very large scale integration; Wires;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Design: VLSI in Computers and Processors, 1988. ICCD '88., Proceedings of the 1988 IEEE International Conference on
  • Conference_Location
    Rye Brook, NY
  • Print_ISBN
    0-8186-0872-2
  • Type

    conf

  • DOI
    10.1109/ICCD.1988.25735
  • Filename
    25735