A parallel compact hash table

Authors:
Steven van der Vegt;Alfons Laarman
Affiliations:
Formal Methods and Tools, University of Twente, The Netherlands;Formal Methods and Tools, University of Twente, The Netherlands
Venue:
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Year:
2011

Citing 6
Cited 2

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Compact Hash Tables Using Bidirectional Linear Probing

IEEE Transactions on Computers
The Art of Multiprocessor Programming

The Art of Multiprocessor Programming
A nearly memory-optimal data structure for sets and mappings

SPIN'03 Proceedings of the 10th international conference on Model checking software
Boosting multi-core reachability performance with shared hash tables

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Parallel recursive state compression for free

Proceedings of the 18th international SPIN conference on Model checking software

Performance of an intuitive hash table in shared-memory parallel programs

Proceedings of the High Performance Computing Symposium
SpinS: Extending LTSmin with Promela through SpinJa

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.