A heuristic storage for minimizing access time of arbitrary data patterns

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 4, 1997, Pages 441-447

  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

Boolean matrices; Heuristics; Memory organization; NP complete; Parallel memories; Performance evaluation; Storage schemes

Indexed keywords

BOOLEAN ALGEBRA; COST EFFECTIVENESS; DATA STORAGE EQUIPMENT; DATA TRANSFER; HEURISTIC PROGRAMMING; MATRIX ALGEBRA; NONLINEAR PROGRAMMING; PROGRAM COMPILERS; RESPONSE TIME (COMPUTER SYSTEMS);

ACCESS TIME; ARBITRARY DATA PATTERNS; HEURISTIC STORAGE; LINEAR ADDRESS TRANSFORMATIONS; SINGLE INSTRUCTION STREAM MULTIPLE DATA STREAMS (SIMD) COMPUTERS;

PARALLEL PROCESSING SYSTEMS;

EID: 0031117383     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.588625     Document Type: Article

References (12)

1. 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.
2. 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.
3. 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.
4. 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.
5. 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.
6. K. Batcher, "The Multidimensional Access Memory in STARAN," IEEE Trans. Computers, vol. 26, no. 2, pp. 174-177, Feb. 1977.
7. 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.
8. M. Al-Mouhamed and S. Seiden, "A Cost-Effective Heuristic Storage for Minimizing Access Time of Arbitrary Data Templates," Technical Report ICS-UCI 93-30, Univ. of California, Irvine, June 18, 1993.
9. T.J. Schaefer, "The Complexity of Satisfiability Problems," Proc. 10th Ann. Symp. Theory of Computing, pp. 216-226, 1978.
10. J. McHugh, Algorithmic Graph Theory. Prentice Hall, 1990.
11. G.J. Chaitan, "Register Allocation and Spilling via Graph Coloring," ACM SIGPLAN Notices, vol. 17, no. 2, pp. 201-207, 1982.
12. B. Bollobàs, Graph Theory: An Introductory Course. Springer-Verlag, 1979.