Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Distributing Hot-Spot Addressing in Large-Scale Multiprocessors
IEEE Transactions on Computers
An optimal parallel dictionary
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
How to distribute a dictionary in a complete network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Low contention load balancing on large-scale multiprocessors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Contention in shared memory algorithms
Journal of the ACM (JACM)
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Journal of Algorithms
| Hi-index | 0.01 |
We consider the problem of minimizing contention in static dictionary data structures, where the contention on each cell is measured by the expected number of probes to that cell given an input that is chosen from a distribution that is not known to the query algorithm (but that may be known when the data structure is built). When all positive queries are equally probable, and similarly all negative queries are equally probable, we show that it is possible to construct a data structure using linear space s, a constant number of queries, and with contention O(1/s) on each cell, corresponding to a nearly-flat load distribution. All of these quantities are asymptotically optimal. For arbitrary query distributions, the lack of knowledge of the query distribution by the query algorithm prevents perfect load leveling in this case: we present a lower bound, based on VC-dimension, that shows that for a wide range of data structure problems, achieving contention even within a polylogarithmic factor of optimal requires a cell-probe complexity of Ω(log log n).