Simple Fast Parallel Hashing by Oblivious Execution

@article{Gil1998SimpleFP,
  title={Simple Fast Parallel Hashing by Oblivious Execution},
  author={Joseph Gil and Yossi Matias},
  journal={SIAM J. Comput.},
  year={1998},
  volume={27},
  pages={1348-1375}
}
  • Joseph Gil, Yossi Matias
  • Published in SIAM J. Comput. 1998
  • Mathematics, Computer Science
  • 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 concurrent-read concurrent-write parallel random access machine (crcw pram). Our algorithm uses a novel approach of hashing by "oblivious execution" based on probabilistic analysis. The algorithm is simple and has the… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-5 OF 5 CITATIONS

    Efficient hash tables on the gpu

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Real-time parallel hashing on the GPU

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Real-time parallel hashing on the GPU

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Parallel hashing algorithms on BSP and QSM models

    • Hyunyoung Lee
    • Computer Science
    • 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.
    • 2004
    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 40 REFERENCES

    On Parallel Hashing and Integer Sorting

    VIEW 11 EXCERPTS

    Storing a sparse table with O(1) worst case access time

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Fast and Efficient Simulations among CRCW PRAMs

    VIEW 5 EXCERPTS

    and F

    • R. M. Karp, M. Luby
    • Meyer auf der Heide, Efficient PRAM simulation on a distributed memory machine, in Proc. 24th Annual ACM Symposium on Theory of Computing
    • 1992
    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Every robust CRCW PRAM can efficiently simulate a PRIORITY PRAM

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    An optimal parallel dictionary

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL