This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design and Analysis of a Gracefully Degrading Interleaved Memory System
January 1990 (vol. 39 no. 1)
pp. 63-71

The organization of interleaved memories in such a way that faults in the memory system degrade the performance in a graceful manner is studied. Attention is restricted to an interleaved memory system that starts out with 2/sup q/ memory banks and uses a low-order interleaving scheme. The motivation and design objectives of the memory system are described. A new reconfiguration scheme and the design of the hardware needed to implement it are presented. The reconfiguration scheme is evaluated using trace-driven simulation for a number of benchmarks. The ideas presented can easily be extended to other interleaved memory schemes.

[1] D. P. Bhandarkar, "Analysis of memory interference in multiprocessors,"IEEE Trans. Comput., vol. C-24, pp. 897-908, Sept. 1975.
[2] G. Burnett and E. G. Coffman, "A study of interleaved memory systems," inProc. AFIPS 1970 Spring Joint Comput. Conf., 1970, pp. 467-474.
[3] K. C. Cheung, "Organization and analysis of interleaved memory systems," M.S. Thesis, Dep. Elec. Comput. Eng., Univ. of Wisconsin-Madison, Madison, WI, 1987.
[4] R.P. Gabriel,Performance and Evaluation of Lisp Systems, MIT Press, Cambridge, Mass., 1985.
[5] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
[6] P. M. Kogge,The Architecture of Pipelined Computers. New York: McGraw-Hill, 1981.
[7] D. J. Kuck and R. A. Stokes, "The Burroughs scientific processor (BSP),"IEEE Trans. Comput., vol. C-31, pp. 363-376, May 1982.
[8] D. H. Lawrie and C. R. Vora, "The prime memory system for array access,"IEEE Trans. Comput., vol. C-31, pp. 435-442, May 1982.
[9] M. Malkawi and J. H. Patel, "Performance measurement of paging behavior in multiprogrammed systems," inProc. 13th Annu. Symp. Comput. Architecture, June 1986, pp. 111-118.
[10] C. Mead and L. Conway,Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980, pp. 150-152.
[11] D. K. Pradhan,Fault Tolerant Computing: Theory and Techniques. Englewood Cliffs, NJ: Prentice-Hall, 1986.
[12] B. R. Rau, "Program behavior and the performance of interleaved memories,"IEEE Trans. Comput., vol. C-28, pp. 191-199, Mar. 1979.
[13] A. J. Smith, "A modified working set paging algorithm,"IEEE Trans. Comput., vol. C-25, pp. 907-914, Sept. 1976.
[14] A. Smith, "Cache Memories,"Computing Surveys, Vol. 14, No. 3, Sept. 1982, pp. 473- 530.
[15] J. E. Smith and J. R. Goodman, "A study of instruction cache organizations and replacement policies," inProc. 10th Symp. Comput. Architecture, June 1983, pp. 132-137.
[16] F. W. Terman, "A study of interleaved memory systems by trace driven simulation," inProc. Symp. Simulation Comput. Syst., 1976, pp. 3-9.

Index Terms:
gracefully degrading interleaved memory system; interleaved memories; reconfiguration scheme; trace-driven simulation; digital storage; fault tolerant computing.
Citation:
K.C. Cheung, G.S. Sohi, K.K. Salvia, D.K. Pradhan, "Design and Analysis of a Gracefully Degrading Interleaved Memory System," IEEE Transactions on Computers, vol. 39, no. 1, pp. 63-71, Jan. 1990, doi:10.1109/12.46281
Usage of this product signifies your acceptance of the Terms of Use.