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.

Keywords

Load Factor Hash Function Memory Access Hash Table Critical Section 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amble, O., Knuth, D.E.: Ordered Hash Tables. The Computer Journal 17(2), 135–142 (1974)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers 35, 677–691 (1986)CrossRefMATHGoogle Scholar
  3. 3.
    Cleary, J.G.: Compact Hash Tables Using Bidirectional Linear Probing. IEEE Transactions on Computers C-33(9), 828–834 (1984)CrossRefMATHGoogle Scholar
  4. 4.
    Click, C.: A Lock-Free Hash Table. Talk at JavaOne (2007), http://www.azulsystems.com/events/javaone_2007/2007_LockFreeHash.pdf
  5. 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)CrossRefGoogle Scholar
  6. 6.
    Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. M. Kaufmann (2008)Google Scholar
  7. 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. 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)CrossRefGoogle Scholar
  9. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Steven van der Vegt
    • 1
  • Alfons Laarman
    • 1
  1. 1.Formal Methods and ToolsUniversity of TwenteThe Netherlands

Personalised recommendations