Conflict-Free Access for Streams in Multimodule Memories

IEEE Transactions on Computers

Volumn 44, Issue 5, 1995, Pages 634-646

  Valero, Mateo ^a   Lang, Tomas ^b   Peiron, Montse ^b   Ayguade, Eduard ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Conflict free access; decoupled access; multimodule memories; out of order access; storage schemes; streams with constant strides; vector processors

Indexed keywords

ADDRESS TRANSFORMATION SCHEMES; CONFLICT FREE ACCESS; DECOUPLED ACCESS; MULTIMODULE MEMORIES; STREAMS WITH CONSTANT STRIDES; VECTOR PROCESSORS;

BANDWIDTH; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; DATA ACQUISITION; DATA STRUCTURES; MICROPROCESSOR CHIPS;

DATA STORAGE EQUIPMENT;

EID: 0029308098     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.381949     Document Type: Article

References (17)

1. P. Budnik and D.J. Kuck, “The organization and use of parallel memories,” IEEE Trans. Computers, vol. 20, no. 12, pp. 1, 566–1, 569, 1971.
2. C-L. Chen and C-K Liao, “Analysis of vector access performance on skewed interleaved memory,” Int'l Symp. Computer Architecture, pp. 387–394, 1989.
3. J. Frailong, W. Jalby, and J. Lenfant, “XOR-schemes: A flexible data organization in parallel memories,” Int'l Conf. Parallel Processing, pp. 276–283, 1985.
4. J.W.C. Fu and J.H. Patel: “Data prefetching in multiprocessor vector cache memories,” Int'l Symp. Computer Architecture, pp. 54–63, 1991.
5. D.T. Harper III and JR. Jump, “Performance evaluation of vector accesses in parallel memories using a skewed storage scheme,” Int'l Symp. Computer Architecture, pp. 324–328, 1986.
6. D.T. Harper III, “Block, multistride vector and FFT accesses in parallel memory systems,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 43–51, 1991.
7. D.T. Harper III and Y. Costa, “Analytical estimation of vector access performance in parallel memory architectures,” Internal Report, Dept. of Electrical Eng., Univ. of Texas at Dallas, 1991.
8. D.T. Harper III and DA. Linebarger, “Conflict-free vector access using a dynamic storage scheme,” IEEE Trans. Computers, vol. 40, no. 3, pp. 276–283, 1991.
9. D.H. Lawrie, “Access and alignment of data in an array processor,” IEEE Trans. Computers, vol. 24, no. 12, pp. 1, 145–1, 155, Dec. 1975.
10. A. Norton and E. Melton, “A class of boolean linear transformations for conflict-free power-of-two stride access,” Int'l Conf. Parallel Processing, pp. 247–254, 1987.
11. W. Oed and O. Lange, “On the effective bandwidth of interleaved memories in vector processing systems,” IEEE Trans. Computers, vol. 34, no. 10, pp. 949–957, Oct. 1985.
12. B.R. Rau, M.S. Schlansker, and D.W.L. Yen, “The Cydra∡ 5 stride-insensitive memory system,” Int'l Conf. Parallel Processing, pp. 242–246, 1989.
13. B.R. Rau, “pseudorandomly interleaved memory,” Int'l Symp. Computer Architecture, pp. 74–83, 1991.
14. M. Valero, T. Lang, and E. Ayguade, “Conflict-free access of vectors with power-of-two strides,” Int'l Conf Supercomputing, pp. 149–156, 1992.
15. M. Valero, T. Lang, J.M. Llaberia, M. Peiron, E. Ayguade, and J.J. Navarro: “Increasing the number of strides for conflict-free vector access,” Int'l Symp. Computer Architecture, pp. 372–381, 1992.
16. S. Weiss, “An aperiodic storage scheme to reduce memory conflicts in vector processors,” Int'l Symp. Computer Architecture, pp. 380–386, 1989.
17. H.A.G. Wijshoff and J. van Leeuwen, “The structure of periodic storage schemes for parallel memories,” IEEE Trans. Computers, vol. 34, pp. 501–505, June 1985.