skip to main content
poster

LHlf: lock-free linear hashing (poster paper)

Published:25 February 2012Publication History
Skip Abstract Section

Abstract

LHlf is a new hash table designed to allow very high levels of concurrency. The table is lock free and grows and shrinks auto-matically according to the number of items in the table. Insertions, lookups and deletions are never blocked. LHlf is based on linear hashing but adopts recursive split-ordering of the items within a bucket to be able to split and merge lists in a lock free manner. LHlf is as fast as the best previous lock-free design and in addition it offers stable performance, uses less space, and supports both expansions and contractions.

References

  1. Griswold, W. G. and Townsend, G. M. 1993. The Design and Implementation of Dynamic Hashing for Sets and Tables in Icon". Software - Practice and Experience, 23(4):351--67. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Harris, T. L. 2001. A Pragmatic Implementation of Non-Blocking Linked-Lists. DISC '01: 300--314. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Herlihy, M., Luchangco, V., and Moir, M. 2002. The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures. DISC '02: 339--353. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Larson, P.-Å. 1988. Dynamic Hash Tables, CACM 31(4): 446--457. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Litwin, W. 1980. Linear Hashing: A New Tool for File and Table Addressing, VLDB '80: 212--223. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Michael, M. M. 2002. High Performance Dynamic Lock-free Hash Tables and List-based Sets. SPAA '02: 73--82. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Michael, M. M. 2004. Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects. IEEE TPDS 15(6): 491--504. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Shalev, O. and Shavit, N. 2006. Split-ordered Lists: Lock-free Extensible Hash Tables. JACM 53(3): 379--405. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. LHlf: lock-free linear hashing (poster paper)

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM SIGPLAN Notices
      ACM SIGPLAN Notices  Volume 47, Issue 8
      PPOPP '12
      August 2012
      334 pages
      ISSN:0362-1340
      EISSN:1558-1160
      DOI:10.1145/2370036
      Issue’s Table of Contents
      • cover image ACM Conferences
        PPoPP '12: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
        February 2012
        352 pages
        ISBN:9781450311601
        DOI:10.1145/2145816

      Copyright © 2012 Authors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 25 February 2012

      Check for updates

      Qualifiers

      • poster

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!