Prime memory systems do not require euclidean division by a prime number - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Prime memory systems do not require euclidean division by a prime number

André Seznec
Yvon Jégou
  • Function : Author
  • PersonId : 830503

Abstract

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1654.pdf (369.92 Ko) Télécharger le fichier

Dates and versions

inria-00074903 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074903 , version 1

Cite

André Seznec, Yvon Jégou, Jacques Lenfant. Prime memory systems do not require euclidean division by a prime number. [Research Report] RR-1654, INRIA. 1992. ⟨inria-00074903⟩
180 View
44 Download

Share

Gmail Facebook Twitter LinkedIn More