A Parallel Compact Hash Table

Steven van der Vegt, Alfons Laarman

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    9 Citations (Scopus)
    128 Downloads (Pure)

    Abstract

    We present the first parallel compact hash table algorithm. It delivers high performance and scalability due to its dynamic region-based locking scheme with only a fraction of the memory requirements of a regular hash table.
    Original languageUndefined
    Title of host publicationProceedings of Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2011
    EditorsTomas Vojnar
    Place of PublicationLondon
    PublisherSpringer
    Pages191-204
    Number of pages14
    ISBN (Print)978-3-642-25929-6
    DOIs
    Publication statusPublished - 7 Oct 2011

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer Verlag
    Volume7119

    Keywords

    • IR-78262
    • METIS-278856
    • Multi-Core
    • Cleary table
    • EWI-20648
    • Parallel
    • lockless
    • compact hash table
    • ordered hash table

    Cite this

    van der Vegt, S., & Laarman, A. (2011). A Parallel Compact Hash Table. In T. Vojnar (Ed.), Proceedings of Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2011 (pp. 191-204). (Lecture Notes in Computer Science; Vol. 7119). London: Springer. https://doi.org/10.1007/978-3-642-25929-6_18