Block, multistride vector, and FFT accesses in parallel memory systems
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 2 (1) , 43-51
- https://doi.org/10.1109/71.80188
Abstract
A discussion is presented of the use of dynamic storage schemes to improve parallelmemory performance during three important classes of data accesses: vector accesses inwhich multiple strides are used to access a single vector, block accesses, andconstant-geometry FFT accesses. The schemes investigated are based on linear addresstransformations, also known as XOR schemes. It has been shown that this class ofschemes can be implemented more efficiently in hardware and has more flexibility thanschemes based on row rotations or other techniques. Several analytical results areshown. These include: quantitative analysis of buffering effects in pipelined memorysystems; design rules for storage schemes that provide conflict-free access usingmultiple strides, blocks, and FFT access patterns; and an analysis of the effects ofmemory bank cycle time on storage scheme capabilities.Keywords
This publication has 18 references indexed in Scilit:
- A Dynamic Storage Scheme For Conflict-free Vector AccessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Perfect Latin Squares And Parallel Array AccessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Scrambled storage for parallel memory systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Conflict-free vector access using a dynamic storage schemeIEEE Transactions on Computers, 1991
- Impact of Hierarchical Memory Systems On Linear Algebra Algorithm DesignThe International Journal of Supercomputing Applications, 1988
- Vector Access Performance in Parallel Memories Using a Skewed Storage SchemeIEEE Transactions on Computers, 1987
- The Prime Memory System for Array AccessIEEE Transactions on Computers, 1982
- The Burroughs Scientific Processor (BSP)IEEE Transactions on Computers, 1982
- Access and Alignment of Data in an Array ProcessorIEEE Transactions on Computers, 1975
- A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storageIEEE Transactions on Audio and Electroacoustics, 1967