Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
