ACM SIGARCH Computer Architecture News · 1986 · 20 citations · 7 references
ComputingComputer EngineeringComputer ScienceMemoryParallel ComputingStorage SystemsMemory Hierarchy DesignMemory Hierarchy OptimizationMemory ManagementMemory Subsystem DesignParallel Computer ArchitectureParallel Memory ManagementData Skew HandlingMemory ConflictsMemory Locality OptimizationParallel SystemProcessing ArchitectureVector ProcessingVector Processing UnitsVectorization
This paper presents and evaluates a scheme for reducing the average memory access time in a vector processing architecture. This scheme uses data skewing to distribute vectors among the modules of a parallel memory system in such a way that, for typical vector access patterns, the average number of memory conflicts is reduced. It also employs both address and data buffers in each module to smooth out the transient irregularities that occur in some vector access patterns. Most previous data skewing techniques were developed to provide conflict-free access for a limited set of access strides. While the proposed scheme does not eliminate all conflicts, it improves the average performance over non-skewed parallel memories by significantly reducing the number of conflicts for a wide range of strides. Also, this effect is much less dependent on the number of memory modules than the skewing schemes used to obtain conflict-free access.
7
The Prime Memory System for Array Access
Lawrie, Vora · IEEE Transactions on Computers · 1982 · 174 citations