Prime memory systems do not require Euclidean division by a prime number
André Seznec, Yvon Jégou, Jacques Lenfant, 35 (France). Unite de Recherche de Rennes Institut National de Recherche en Informatique et en Automatique (INRIA), 35 - Rennes (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA) Centre National de la Recherche Scientifique (CNRS), 35 (France). Inst. de Recherche en Informatique et Systemes Aleatoires (IRISA) Rennes-1 Univ., 35 (France). Inst . de Recherche en Informatique et Systemes Aleatoires (IRISA) Institut National des Sciences Appliquees de Rennes (INSA) · OpenGrey (Institut de l'Information Scientifique et Technique) · 1992
Using a prime number N of memory banks on a vector processor allows a conflict-free access for any slice of N consecutive elements of a vector stored with a stride not multiple of N. To reject the use of such 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 prime number N. In this short note, we show that there exists a very simple mapping of data in the memory banks for which address compulations does not require any Euclidean Division.