This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nonprime Memory Systems and Error Correction in Address Translation
January 1997 (vol. 46 no. 1)
pp. 75-79

Abstract—Using a prime number p of memory banks on a vector processor allows a conflict-free access for any slice of p consecutive elements of a vector stored with a stride not multiple of p. To reject the use of a prime number of memory banks, it is generally advanced that address computation for such a memory system would require systematic Euclidean division by the number p. The Chinese Remainder Theorem allows a simple mapping of data onto the memory banks for which address computation does not require any Euclidean division. However, this requires that the number of words in each memory module m and p be relatively prime. We propose a method based on the Chinese Remainder Theorem for moduli with common factors that does not have such a restriction. The proposed method does not require Euclidean division and also results in an efficient error detection/correction mechanism for address translation.

[1] P. Budnik and D.J. Kuck, "The Organization and Use of Parallel Memories," IEEE Trans. Computers, vol. 20, no. 12, pp. 1,566-1,569, Dec. 1971.
[2] D.J. Kuck and R. Stokes, "The Burroughs Scientific Processor," IEEE Trans. Computers, vol. 31, no. 5, pp. 363-376, May 1982.
[3] D.H. Lawrie and C.R. Vora, "The Prime Memory System for Array Access," IEEE Trans. Computers, vol. 31, no. 5, pp. 435-442, May 1982.
[4] M. Balakrishnan, R. Jain, and C.S. Raghavendra, "On Array Storage for Conflict-Free Access for Parallel Processors," Proc. 17th Int'l Conf. Parallel Processing, pp. 103-107, 1988.
[5] K. Kim and V.K. Kumar, "Perfect Latin Squares and Parallel Array Access," Proc. 16th Int'l Symp. Computer Architecture, pp. 372-379, 1989.
[6] C.J. Colbourn and K. Heirich, "Conflict-Free Access to Parallel Memories," J. Parallel and Distributed Computing, vol. 14, pp. 193-200, 1992.
[7] Q.S. Gao, "The Chinese Remainder Theorem and the Prime Memory System," Proc. 20th Int'l Symp. Computer Architecture, pp. 337-340, 1993.
[8] N.S. Szabo and R.I. Tanaka, Residue Arithmetic and its Application to Computer Technology.New York: McGraw-Hill, 1967.
[9] R.S. Katti, "A New Residue Arithmetic Error Correction Scheme," IEEE Trans. Computers, vol. 45, no. 1, pp. 13-19, Jan. 1996.
[10] T.R.N. Rao and Fujiwara, Error-Coding for Computer Systems.Englewood Cliffs, N.J.: Prentice Hall, 1989.
[11] A. Avizienis, G.C. Gilley, F.P. Mathur, D.A. Rennels, J.A. Rohr, and D.K. Rubin, "The STAR (Self-Testing and Repairing) Computer: An Investigation of the Theory and Practice of Fault-Tolerant Computer Design," IEEE Trans. Computers, vol. 20, no. 11, pp. 1,312-1,321, Nov. 1971.
[12] G.L. Feng, T.R.N. Rao, and M.S. Kolluru, "Error Correcting Codes Over$Z_{2^m}$for Algorithm-Based Fault Tolerance," IEEE Trans. Computers, vol. 43, no. 3, pp. 370-374, Mar. 1994.
[13] A. Seznec and J. Lenfant, "Odd Memory Systems May Be Quite Interesting," Proc. 20th Int'l Symp. Computer Architecture, pp. 341-350, 1993.

Index Terms:
Address translation, error correction, error detection, logical address, memory systems, physical address, vector processors.
Citation:
Rajendra S. Katti, "Nonprime Memory Systems and Error Correction in Address Translation," IEEE Transactions on Computers, vol. 46, no. 1, pp. 75-79, Jan. 1997, doi:10.1109/12.559804
Usage of this product signifies your acceptance of the Terms of Use.