An Aperiodic Storage Scheme To Reduce Memory Conflicts In Vector Processors
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 380-386
- https://doi.org/10.1109/isca.1989.714576
Abstract
One of the most noticeable differences between the CRAY-2 and its predecessors, the CRAY-1 and the CRAY X-MP, is a significantly longer memory path. This is a consequence of increasing the size of the memory at the expense of the bank access time. With a longer memory path, the impact of bank conflicts becomes more apparent. In this paper we study a stor- age strategy for vector processors that has the following properties: (1) it is aperiodic, (2) it tends to distribute references more uniformly over the memory banks, (3) the implementation of the addressing hardware is straightforward, and (4) the delay added to the memory path is minimal. The first two properties help in reducing the frequency of bank conflicts.Keywords
This publication has 12 references indexed in Scilit:
- Scrambled storage for parallel memory systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Characterizing computer performance with a single numberCommunications of the ACM, 1988
- Vector Access Performance in Parallel Memories Using a Skewed Storage SchemeIEEE Transactions on Computers, 1987
- Data synchronized pipeline architecture: Pipelining in multiprocessor environmentsJournal of Parallel and Distributed Computing, 1986
- The Structure of Periodic Storage Schemes for Parallel MemoriesIEEE Transactions on Computers, 1985
- Parallele AlgorithmenPublished by Springer Nature ,1983
- The Prime Memory System for Array AccessIEEE Transactions on Computers, 1982
- The Burroughs Scientific Processor (BSP)IEEE Transactions on Computers, 1982
- Theoretical Limitations on the Efficient Use of Parallel MemoriesIEEE Transactions on Computers, 1978
- The Organization and Use of Parallel MemoriesIEEE Transactions on Computers, 1971