This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimization of Memory and Network Contention for Accessing Arbitrary Data Patterns in SIMD Systems
June 1996 (vol. 45 no. 6)
pp. 757-762

Abstract—Finding general XOR-schemes to minimize memory and network contention for accessing arrays with arbitrary sets of data templates is presented. A combined XOR-matrix is proposed together with a necessary and sufficient condition for conflict-free access. We present a new characterization of the baseline network. Finding an XOR-matrix for combined templates is shown to be an NP-complete problem. A heuristic is proposed for finding XOR-matrices by determining the constraints of each template-matrix and solving a set of simultaneous equations for each row. Evaluation shows significant reduction of memory and network contention compared to interleaving and to static row-column-diagonals storage.

[1] D.H. Bailey,“Vector computer memory bank contention,” IEEE Trans. Computers, vol. 36, pp. 293-298, 1987.
[2] K. Batcher, "The Multidimensional Access Memory in STARAN," IEEE Trans. Computers, vol. 26, no. 2, pp. 174-177, Feb. 1977.
[3] V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic.New York: Academic Press, 1965.
[4] R.V Boppana and C.S. Raghavendra, "Efficient Storage Schemes for Arbitrary Size Square Matrices in Parallel Processors with Shuffle-Exchange Networks," Proc. Int'l Conf. Parallel Processing, pp. 365-368, 1991.
[5] P. Budnik and D. Kuck, "The Organization and Use of Parallel Memories," IEEE Trans. Computers, vol. 20, no. 12, pp. 1,566-1,569, Dec. 1971.
[6] J.M Jalby, W. Frailong, and J. Lenfant, "XOR-Schemes: A Flexible Data Organization in Parallel Memories," Proc. Int'l Conf. Parallel Processing, pp. 276-283, 1985.
[7] M.R Garey, D.S. Johnson, and L. Stockmeyer, "Some Simplified NP-Complete Graph Problems," Theoretical Computer Science, vol. 2, pp. 237-267, 1976.
[8] D.T. Harper III,“Block, multistride vector and FFT accesses in parallel memorysystems,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 43-51, 1991.
[9] D. 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] D. Lawrie and C.R. Vora, "The Prime Memory System for Array Accesses," IEEE Trans. Computers, vol. 31, no. 5, pp. 435-442, May 1982.
[11] A. Norton and E. Melton, "A Class of Boolean Linear Transformations for Conflict-Free Power-of-Two Stride Access," Proc. Int'l Conf. Parallel Processing, pp. 247-254, 1987.
[12] S. Seiden and M. Al-Mouhamed, "Minimization of Memory and Network Contention for Accessing Arbitrary Data Patterns in SIMD Systems," Univ. of California Irvine, ICS-UCI Technical Report 93-29, June 1993.
[13] H.J Siegel, "Interconnection Networks for SIMD Machines," Computer, vol. 12, pp. 57-67, June 1979.
[14] G.S. Sohi,“High-bandwidth interleaved memories for vector processors—Asimulation study,” IEEE Trans. Computer Systems, vol. 42, pp. 34-44, 1993.

Index Terms:
Memory conflicts, multistage networks, NP-completeness, parallel memories, storage schemes.
Citation:
Mayez A. Al-Mouhamed, Steven S. Seiden, "Minimization of Memory and Network Contention for Accessing Arbitrary Data Patterns in SIMD Systems," IEEE Transactions on Computers, vol. 45, no. 6, pp. 757-762, June 1996, doi:10.1109/12.506432
Usage of this product signifies your acceptance of the Terms of Use.