Simple fast parallel hashing
A hash table is a representation of a set in a linear size data structure that supports constant-time membership queries. We show how to construct a hash table for any given set of n keys in O(lg lg n) parallel time with high probability, using n processors on a weak version of a crcw pram.
Partition the input set into buckets by a random polynomial of constant degree.
For t:=1 to O(lg lg n) do
Allocate M t memory blocks, each of size B t , where M t and B t are carefully a priori selected parameters.
Let each bucket select a block at random, and try to injectively map its keys into the block using a random linear function. Buckets that fail carry on to the next iteration.
The algorithm uses only O(lg lg n) random words, and can be implemented in a work-efficient manner.
- Simple fast parallel hashing
- Book Title
- Automata, Languages and Programming
- Book Subtitle
- 21st International Colloquium, ICALP 94 Jerusalem, Israel, July 11–14, 1994 Proceedings
- pp 239-250
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.