Bank-interleaved cache or memory indexing does not require euclidean division

André Seznec 1
1 ALF - Amdahl's Law is Forever
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
Abstract : ! Abstract Concurrent access to bank-interleaved memory structure have been studied for decades, particularly in the context of vector supercomputer systems. It is still common belief that using a number of banks different from 2 n leads to insert a complex hardware including a non-trivial divider on the access path to the memory. In 1993, two independent studies [1], [2] were showing that through leveraging a very simple arithmetic result, the Chinese Remainder Theorem, this euclidean division is not needed when the number of banks is prime or simply odd. In the mid 90's, the interest for vector supercomputers faded and the research topic disappeared. The interest for bank-interleaved cache has reappeared recently [3] in the GPU context. In this short paper, we extend the result from [1] and we show that, regardless the number of banks: Bank-interleaved cache or memory indexing does not require euclidean division.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01208356
Contributor : André Seznec <>
Submitted on : Friday, October 2, 2015 - 2:30:31 PM
Last modification on : Thursday, February 7, 2019 - 4:16:05 PM
Document(s) archivé(s) le : Sunday, January 3, 2016 - 10:50:51 AM

File

EuclideanDivision.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01208356, version 1

Citation

André Seznec. Bank-interleaved cache or memory indexing does not require euclidean division. 11th Annual Workshop on Duplicating, Deconstructing and Debunking, Jun 2015, Portland, United States. ⟨hal-01208356⟩

Share

Metrics

Record views

638

Files downloads

335