Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
Security problems on inference control for SUM, MAX, and MIN queries
Journal of the ACM (JACM)
How to share memory in a distributed system
Journal of the ACM (JACM)
Parallel hashing—an efficient implementation of shared memory
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On storage schemes for parallel array access
ICS '92 Proceedings of the 6th international conference on Supercomputing
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
A practical constructive scheme for deterministic shared-memory access
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Computationally private information retrieval (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Protecting data privacy in private information retrieval schemes
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Secure databases: protection against user influence
ACM Transactions on Database Systems (TODS)
Principles of Database Systems
Principles of Database Systems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A Random Server Model for Private Information Retrieval (or Information Theoretic PIR Avoiding Database Replication
Hi-index | 0.00 |
We address the problem of organizing a set T of shared data into the memory modules of a Distributed Memory Machine (DMM) in order to minimize memory access conflicts during read operations. In this paper we present a new randomized scheme that, with high probability, performs any set of r unrelated read operations on the shared data set T in O(log r + loglog|T|) parallel time with no memory conflicts and using O(r) processors. The set T is distributed into m DMM memory modules where m is polynomial in r and logarithmic in T, and the overall size of the shared memory used by our scheme is not larger than (1+1/ log |T|)|T| (this means that there is "almost" no data replication). The memory organization scheme and most part of all the computations of our method do not depend on the read requests, so they can be performed once and for all during an off-line phase. This is a relevant improvement over the previous deterministic method recently given in [1] when "real-time" applications are considered.