Skip to main content
SpringerLink
Log in

A Parallel Compact Hash Table

  • Conference paper
Mathematical and Engineering Methods in Computer Science (MEMICS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7119))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amble, O., Knuth, D.E.: Ordered Hash Tables. The Computer Journal 17(2), 135–142 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers 35, 677–691 (1986)

    Article  MATH  Google Scholar 

  3. Cleary, J.G.: Compact Hash Tables Using Bidirectional Linear Probing. IEEE Transactions on Computers C-33(9), 828–834 (1984)

    Article  MATH  Google Scholar 

  4. Click, C.: A Lock-Free Hash Table. Talk at JavaOne (2007), http://www.azulsystems.com/events/javaone_2007/2007_LockFreeHash.pdf

  5. Geldenhuys, J., Valmari, A.: A Nearly Memory-Optimal Data Structure for Sets and Mappings. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 136–150. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. M. Kaufmann (2008)

    Google Scholar 

  7. Laarman, A.W., van de Pol, J.C., Weber, M.: Boosting Multi-Core Reachability Performance with Shared Hash Tables. In: Sharygina, N., Bloem, R. (eds.) FMCAD 2010, pp. 247–255. IEEE Computer Society (2010)

    Google Scholar 

  8. Laarman, A., van de Pol, J., Weber, M.: Parallel Recursive State Compression for Free. In: Groce, A., Musuvathi, M. (eds.) SPIN Workshops 2011. LNCS, vol. 6823, pp. 38–56. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. van der Vegt, S.: A Concurrent Bidirectional Linear Probing Algorithm. In: Heijnen, C., Koppelman, H. (eds.) 15th Twente Student Conference on Information Technology, Enschede, The Netherlands, Enschede. TSConIT, vol. 15, pp. 269–276. Twente University Press (2011), http://referaat.cs.utwente.nl/TSConIT/download.php?id=981

Download references

Author information

Authors and Affiliations

  1. Formal Methods and Tools, University of Twente, The Netherlands

    Steven van der Vegt & Alfons Laarman

Authors
  1. Steven van der Vegt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alfons Laarman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Information Technology, Brno University of Technology, Božetěchova 2, 612 66, Brno, Czech Republic

    Zdeněk Kotásek , Lukáš Sekanina  & Tomáš Vojnar ,  & 

  2. Faculty of Informatics, Masaryk University, Botanická 68a, 60200, Brno, Czech Republic

    Jan Bouda  & Ivana Černá  & 

  3. Institute of Computer Science, Masaryk University, Botanická 68a, 60200, Brno, Czech Republic

    David Antoš

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van der Vegt, S., Laarman, A. (2012). A Parallel Compact Hash Table. In: Kotásek, Z., Bouda, J., Černá, I., Sekanina, L., Vojnar, T., Antoš, D. (eds) Mathematical and Engineering Methods in Computer Science. MEMICS 2011. Lecture Notes in Computer Science, vol 7119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25929-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25929-6_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25928-9

  • Online ISBN: 978-3-642-25929-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation