Title :
Minimization of memory and network contention for accessing arbitrary data patterns in SIMD systems
Author :
Al-Mouhamed, Mayez A. ; Seiden, Steven S.
Author_Institution :
Dept. of Comput. Eng., King Fahd Univ. of Pet. & Miner., Dhahran, Saudi Arabia
fDate :
6/1/1996 12:00:00 AM
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
Keywords :
Boolean algebra; Boolean functions; computational complexity; matrix algebra; memory architecture; multistage interconnection networks; parallel processing; storage management; NP-complete problem; SIMD systems; XOR-matrices; arbitrary data patterns; baseline network; conflict-free access; interleaving; memory contention; multistage networks; network contention; parallel memories; static row-column-diagonals storage; storage schemes; template-matrix; Circuit faults; Circuit testing; Costs; Design automation; Intelligent networks; Interleaved codes; Minimization; Packaging; Probes; Very large scale integration;
Journal_Title :
Computers, IEEE Transactions on
