Increasing the Number of Strides for Conflict-free Vector Access
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 372-381
- https://doi.org/10.1109/isca.1992.753333
Abstract
Address transformation schemes, such as skewing and linear transformations, have been proposed to achieve conflict-free vector access for some strides in vector processors with multi-module memories. In this paper, we extend these schemes to achieve this conflict-free access for a larger number of strides. The basic idea is to perform an out-of-order access to vectors of fixed length, equal to that of the vector registers of the processor. Both matched and unmatched memories are considered; we show that the number of strides is even larger for the latter case. The hardware for address calculations and access control is described and shown to be of similar complexity as that required for access in order.Keywords
This publication has 9 references indexed in Scilit:
- An Aperiodic Storage Scheme To Reduce Memory Conflicts In Vector ProcessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Analysis Of Vector Access Performance On Skewed Interleaved MemoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Conflict-free vector access using a dynamic storage schemeIEEE Transactions on Computers, 1991
- Block, multistride vector, and FFT accesses in parallel memory systemsIEEE Transactions on Parallel and Distributed Systems, 1991
- Performance evaluation of vector accesses in parallel memories using a skewed storage schemeACM SIGARCH Computer Architecture News, 1986
- On the effective bandwidth of interleaved memories in vector processor systemsIEEE Transactions on Computers, 1985
- The Structure of Periodic Storage Schemes for Parallel MemoriesIEEE Transactions on Computers, 1985
- Access and Alignment of Data in an Array ProcessorIEEE Transactions on Computers, 1975
- The Organization and Use of Parallel MemoriesIEEE Transactions on Computers, 1971