Issue No.06 - June (1996 vol.45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.506432
<p><b>Abstract</b>—Finding general XOR-schemes to minimize memory and network contention for accessing arrays with arbitrary sets of data <it>templates</it> 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.</p>
Memory conflicts, multistage networks, NP-completeness, parallel memories, storage schemes.
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