Reconfigurable Multipipelines for Vector Supercomputers

  • Authors:
  • Rajiv Gupta;Alessandro Zorat;I. V. Ramakrishan

  • Affiliations:
  • Univ. of Southern California, Los Angeles;Univ. of Trento, Trento, Italy;State Univ. of New York, Stony Brook

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1989

Quantified Score

Hi-index 15.00

Visualization

Abstract

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 configuration algorithm is optimal in the sense that it recovers the maximum number of pipelines under any fault pattern. Probabilistic bounds on the delay (the number of bypassed faulty stages) and yield (the number of nonfaulty pipelines recovered) are derived. It is shown that the maximum signal delay in any of the pipelines is O(log m), where m is the initial number of pipelines. A constant fraction of these pipelines can be recovered with the scheme, as opposed to an exponentially decreasing number when no reconfiguration is used. The reconfiguration scheme can also be used to provide fault-tolerant buses on a wafer.