Most of modern microprocessors employ on—chip cache memories to meet the memory bandwidth demand. These caches are now occupying a greater real es tate of chip area. Also, continuous down scaling of transistors increases the possi bility of defects in the cache area which already starts to occupies more than 50% of chip area. For this reason, various techniques have been proposed to tolerate defects in cache blocks. These techniques can be classified into three different cat egories, namely, cache line disabling, replacement with spare block, and decoder reconfiguration without spare blocks. This chapter examines each of those fault tol erant techniques with a fixed typical size and organization of L1 cache, through extended simulation using SPEC2000 benchmark on individual techniques. The de sign and characteristics of each technique are summarized with a view to evaluate the scheme. We then present our simulation results and comparative study of the three different methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hennessy, J.L. and D.A. Patterson. Computer Architecture: A Quantitative Approach, 2nd edition, Morgan Kaufmann, San Mateo, CA, 1996
Sohi, G.S., “Cache Memory Organization to Enhance the Yield of High—Performance VLSI Processors,” IEEE Trans. Comp., Vol. 38, No. 4, pp. 484–492, April 1989
Ooi, Y., M. Kashimura, H. Takeuchi, and E. Kawamura, “Fault—Tolerant Architecture in a Cache Memory Control LSI,” IEEE J. Solid-State. Circ., Vol. 27, No. 4, pp. 507–514, April 1992
Pour, A.F. and M.D. Hill, “Performance Implications of Tolerating Cache Faults,” IEEE Trans. Comp., Vol. 42, No. 3, pp. 257–267, March 1993
Turgeon, P.R., A.R. Stell, and M.R. Charlebois, “Two Approaches to Array Fault Tolerance in the IBM Enterprise System/9000 Type 9121 Processor,” IBM J. Res. Develop., Vol. 35, No. 3, pp. 382–389, May 1991
Lucente, M.A., C.H. Harris, and R.M. Muir, “Memory System Reliability Improvement Through Associative Cache Redundancy,” Proc. IEEE Custom Integr. Circ. Conf., pp. 19.6.1– 19.6.4, Boston, MA, May 1990
Vergos, H.T. and D. Nikolos, “Performance Recovery in Direct—Mapped Faulty Caches via the Use of a Very Small Fully Associative Spare Cache,” Proc. Intl. Comp. Perform. Dependability Symp., pp. 326–332, April 1995
Shirvant, P.P. and E.J. McCluskey, “PADded Cache: A New Fault—Tolerance Technique for Cache Memories,” IEEE VLSI Test Symp., pp. 440–445, April 1999
O'Leary, B.J. and A.J. Sutton, “Dynamic Cache Line Delete,” IBM Tech. Disclosure Bull., Vol. 32, No. 6A, p. 439, Nov. 1989
Stapper, C.H., F.M. Armstrong, and K. Saji, “Integrated Circuit Yield Statistics,” Proc. IEEE, Vol. 71, pp. 453–470, April 1983
Hill, M.D., “A Case for Direct—Mapped Caches,” IEEE Computer Vol. 21, No. 12 Micro, pp. 25–40, Dec. 1988
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media B.V
About this chapter
Cite this chapter
Tu, Hy., Tasneem, S. (2009). Fault Tolerant Cache Schemes. In: Ao, SI., Rieger, B., Chen, SS. (eds) Advances in Computational Algorithms and Data Analysis. Lecture Notes in Electrical Engineering, vol 14. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8919-0_8
Download citation
DOI: https://doi.org/10.1007/978-1-4020-8919-0_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-8918-3
Online ISBN: 978-1-4020-8919-0
eBook Packages: Computer ScienceComputer Science (R0)