Universal graphs for bounded-degree trees and planar graphs
SIAM Journal on Discrete Mathematics
Introduction to algorithms
Conflict-free access to parallel memories
Journal of Parallel and Distributed Computing
Multiple templates access of trees in parallel memory systems
Journal of Parallel and Distributed Computing - Parallel and distributed data structures
Hashing Schemes for Extendible Arrays
Journal of the ACM (JACM)
External Hashing Schemes for Collections of Data Structures
Journal of the ACM (JACM)
Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems
IEEE Transactions on Parallel and Distributed Systems
Latin Squares for Parallel Array Access
IEEE Transactions on Parallel and Distributed Systems
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Conflict-Free Access to Templates of Trees and Hypercubes in Parallel Memory Systems
COCOON '97 Proceedings of the Third 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
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
The Organization and Use of Parallel Memories
IEEE Transactions on Computers
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Microprocessors & Microsystems
| Hi-index | 0.00 |
Techniques are developed for mapping structured data to an ensemble of parallel memory modules in a way that limits the number of conflicts, i.e., simultaneous accesses by distinct processors to the same memory module. The techniques determine, for any given conflict tolerancec, the smallest ensemble that allows one to store anyn{\hbox{-}}\rm node data structure "of type X” in such a way that no more than c nodes of a structure are stored on the same module. This goal is achieved by determining the smallest c{\hbox{-}}{\it perfect universal graphs} for data structures "of type X.” Such a graph is the smallest graph that contains a homomorphic image of each n{\hbox{-}}\rm node structure "of type X,” with each node of the image holding \leq c nodes of the structure. In the current paper, "type X” refers to rooted binary trees and three array-like structures: chaotic arrays, ragged arrays, and rectangular arrays. For each of these families of data structures, the number of memory modules needed to achieve conflict tolerance c is determined to within constant factors.