Deterministic load balancing and dictionaries in the parallel disk model

Authors:
Mette Berger;Esben Rune Hansen;Rasmus Pagh;Mihai Pǎtraşcu;Milan Ružić;Peter Tiedemann
Affiliations:
OctoShape ApS;IT University of Copenhagen, Kobenhavn S, Denmark;IT University of Copenhagen, Kobenhavn S, Denmark;MIT;IT University of Copenhagen, Kobenhavn S, Denmark;IT University of Copenhagen, Kobenhavn S, Denmark
Venue:
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2006

Citing 16
Cited 1

The input/output complexity of sorting and related problems

Communications of the ACM
The analysis of closed hashing under limited randomness

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Chernoff-Hoeffding Bounds for Applications with Limited Independence

SIAM Journal on Discrete Mathematics
Balanced Allocations

SIAM Journal on Computing
Are bitvectors optimal?

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Balanced allocations: the heavily loaded case

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Loss-less condensers, unbalanced expanders, and extractors

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Randomness conductors and constant-degree lossless expanders

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Deterministic dictionaries

Journal of Algorithms
Storing information with extractors

Information Processing Letters
One-Probe Search

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Sorting and Searching on the Word RAM

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Polynomial Hash Functions Are Reliable (Extended Abstract)

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Universal Classes of Extremely Random Constant-Time Hash Functions

SIAM Journal on Computing
Cuckoo hashing

Journal of Algorithms

Algorithms and data structures for external memory

Foundations and Trends® in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider deterministic dictionaries in the parallel disk model, motivated by applications such as file systems. Our main results show that if the number of disks is moderately large (at least logarithmic in the size of the universe from which keys come), performance similar to the expected performance of randomized dictionaries can be achieved. Thus, we may avoid randomization by extending parallelism. We give several algorithms with different performance tradeoffs. One of our main tools is a deterministic load balancing scheme based on expander graphs, that may be of independent interest. Our algorithms assume access to certain expander graphs "for free". While current explicit constructions of expander graphs have suboptimal parameters, we show how to get near-optimal expanders for the case where the amount of data is polynomially related to the size of internal memory.