Minimization of memory and network contention for accessing arbitrary data patterns in SIMD systems

IEEE Transactions on Computers

Volumn 45, Issue 6, 1996, Pages 757-762

  Al Mouhamed, Mayez A ^a   Seiden, Steven S ^b  

^a KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Memory conflicts; Multistage networks; NP completeness; Parallel memories; Storage schemes

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; ELECTRIC NETWORK TOPOLOGY; HEURISTIC METHODS; LOGIC CIRCUITS; MINIMIZATION OF SWITCHING NETS; PROBLEM SOLVING;

MEMORY CONFLICTS; MULTISTAGE NETWORKS; NETWORK CONTENTION; PARALLEL MEMORIES; TEMPLATES; XOR SCHEMES;

PARALLEL PROCESSING SYSTEMS;

EID: 0030166474     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.506432     Document Type: Article

References (14)

1. D. Bailey, "Vector Computer Memory Bank Contentions," IEEE Trans. Computers, vol. 36, no. 3, pp. 293-298, Mar. 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.K. 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 Memory Systems," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 43-51, Jan. 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 - A Simulation Study," IEEE Trans. Computers, vol. 42, no. 1, pp. 34-44, Jan. 1993.