Conflict-free access to subsets of array elements is essential for the effective utilization of parallel memories. Skewing schemes for array storage that provide conflict-free access to all entries in r × s and s × r subarrays are developed, using a strong connection between conflict-free skewing schemes and latin squares.
ASJC Scopus subject areas
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Artificial Intelligence