Analysing the Performance of GPU Hash Tables for State Space Exploration

TL;DR

This paper compares GPU-optimized hash tables, including GPUexplore and Cuckoo hashing, demonstrating that Cuckoo hashing significantly outperforms GPUexplore in speed for state space exploration tasks.

Contribution

It provides an experimental comparison of two GPU hash tables, highlighting Cuckoo hashing's superior performance for model checking applications.

Findings

Cuckoo hashing is three times faster than GPUexplore for random data.

Cuckoo hashing is five to nine times faster for non-random data.

Results suggest potential for further speed improvements in GPU-based model checking.

Abstract

In the past few years, General Purpose Graphics Processors (GPUs) have been used to significantly speed up numerous applications. One of the areas in which GPUs have recently led to a significant speed-up is model checking. In model checking, state spaces, i.e., large directed graphs, are explored to verify whether models satisfy desirable properties. GPUexplore is a GPU-based model checker that uses a hash table to efficiently keep track of already explored states. As a large number of states is discovered and stored during such an exploration, the hash table should be able to quickly handle many inserts and queries concurrently. In this paper, we experimentally compare two different hash tables optimised for the GPU, one being the GPUexplore hash table, and the other using Cuckoo hashing. We compare the performance of both hash tables using random and non-random data obtained from model checking experiments, to analyse the applicability of the two hash tables for state space exploration. We conclude that Cuckoo hashing is three times faster than GPUexplore hashing for random data, and that Cuckoo hashing is five to nine times faster for non-random data. This suggests great potential to further speed up GPUexplore in the near future.