On Linear Skewing Schemes and d-Ordered Vectors
IEEE Transactions on Computers
Scrambled storage for parallel memory systems
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
A dynamic storage scheme for conflict-free vector access
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Perfect Latin squares and parallel array access
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Discrete Applied Mathematics - Special double volume: interconnection networks
Conflict-free template access in k-ary and binomial trees
ICS '97 Proceedings of the 11th international conference on Supercomputing
Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
A Hypergraph Based Approach to Declustering Problems
Distributed and Parallel Databases
Multiple Templates Access of Trees in Parallel Memory Systems
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Mappings for Conflict-Free Access of Paths in Elementary Data Structures
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
(Almost) Optimal parallel block access for range queries
Information Sciences—Informatics and Computer Science: An International Journal
Custom Data Layout for Memory Parallelism
Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
On Design of Parallel Memory Access Schemes for Video Coding
Journal of VLSI Signal Processing Systems
Efficient parallel processing of range queries through replicated declustering
Distributed and Parallel Databases
Data space mapping for efficient I/O in large multi-dimensional databases
Information Systems
Conflict-free star-access in parallel memory systems
Journal of Parallel and Distributed Computing
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories
IEEE Transactions on Parallel and Distributed Systems
A practical approach of memory access parallelization to exploit multiple off-chip DDR memories
Proceedings of the 45th annual Design Automation Conference
Parallel Memory Architecture for Application-Specific Instruction-Set Processors
Journal of Signal Processing Systems
Divide-and-conquer scheme for strictly optimal retrieval of range queries
ACM Transactions on Storage (TOS)
Parallel memory architecture for TTA processor
SAMOS'07 Proceedings of the 7th international conference on Embedded computer systems: architectures, modeling, and simulation
Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays
ACM Transactions on Storage (TOS)
| Hi-index | 0.00 |
A parallel memory system for efficient parallel array access using perfect latin squares asskewing functions is discussed. Simple construction methods for building perfect latinsquares are presented. The resulting skewing scheme provides conflict free access toseveral important subsets of an array. The address generation can be performed inconstant time with simple circuitry. The skewing scheme can provide constant timeaccess to rows, columns, diagonals, and N/sup 1/2/*N/sup 1/2/ subarrays of an N*Narray with maximum memory utilization. Self-routing Benes networks can be used torealize the permutations needed between the processing elements and the memorymodules. Two skewing schemes that provide conflict free access to three-dimensionalarrays are also discussed. Combined with self-routing Benes networks, these schemesprovide efficient access to frequently used subsets of three-dimensional arrays.