This Article 
 Bibliographic References 
 Add to: 
Harvest Rate of Reconfigurable Pipelines
October 1996 (vol. 45 no. 10)
pp. 1200-1203

Abstract—For a reconfigurable architecture, the harvest rate is the expected percentage of defect-free processors that can be connected into the desired topology. In this paper, we give an analytical estimation for the harvest rate of reconfigurable multipipelines based on the following model: There are n pipelines each with m stages, where each stage of a pipeline is defective with identical independent probability 0.5 and spare wires are provided for reconfiguration. By formulating the "shifting" reconfiguration as weighted chains in a partial ordered set, we prove when n = Θ(m), the harvest rate is between 34% and 72%.

[1] M. Aigner, Combinatorial Theory. Springer-Verlag, 1979.
[2] J.W. Greene and A. Gamal, "Configuration of VLSI Arrays in the Presence of Defects," J. ACM, vol. 41, no. 4, pp. 694-717, 1984.
[3] G. Grimmett, Percolation.New York: Springer-Verlag, 1989.
[4] G. Grimmett and H. Kesten, "First Passage Percolation, Network Flows and Electrical Resistances," Z. Wahrscheinlichkeitstheor. Verw 66, pp. 335-366, 1984.
[5] R. Gupta, A. Zorat, and I. V. Ramakrishnan, "Reconfigurable Multipipelines for Vector Supercomputers," IEEE Trans. Computers, vol. 38, no. 9, pp. 1,297-1,307, Sept. 1989.
[6] K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, 1993.
[7] F.T. Leighton and C.E. Leiserson, "Wafer-Scale Integration of Systolic Arrays," IEEE Trans. Computers, vol. 34, no. 5, pp. 448-461, May 1985.
[8] R. Libeskind-Hadas, "Reconfiguration of Fault Tolerant VLSI Systems," PhD thesis, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, Oct. 1993.
[9] J.S. Provan and M.O. Ball, "The Complexity of Counting Cuts and of Computing the Reliability That a Graph Is Connected," SIAM J. Computing, vol. 12, no. 4, pp. 777-788, Nov. 1983.
[10] W. Shi, "Design, Analysis and Reconfiguration of Defect-Tolerant VLSI and Parallel Processing Arrays," PhD thesis, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign, June 1992. Coordinated Science Laboratory Technical Report CRHC-94-21, Sept. 1994.
[11] W.S. Stornetta, B.A. Huberman, and T. Hogg, "Scaling Theory for Fault Stealing Algorithms in Large Systolic Arrays," IEEE Trans. Computer-Aided Design, vol. 9, no. 3, pp. 290-298, Mar. 1990.

Index Terms:
Harvest rate, yield, reconfigurable arrays, defect tolerance, pipelines, random graphs, percolation.
Weiping Shi, Ming-Feng Chang, W. Kent Fuchs, "Harvest Rate of Reconfigurable Pipelines," IEEE Transactions on Computers, vol. 45, no. 10, pp. 1200-1203, Oct. 1996, doi:10.1109/12.543713
Usage of this product signifies your acceptance of the Terms of Use.