A GPU Tree Database for Many-Core Explicit State Space Exploration

Anton Wijs, Muhammad Osama

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)

Samenvatting

Various techniques have been proposed to accelerate explicit-state model checking with GPUs, but none address the compact storage of states, or if they do, at the cost of losing completeness of the checking procedure. We investigate how to implement a tree database to store states as binary trees in GPU memory. We present fine-grained parallel algorithms to find and store trees, experiment with a number of GPU-specific configurations, and propose a novel hashing technique, called Cleary-Cuckoo hashing, which enables the use of Cleary compression on GPUs. We are the first to assess the effectiveness of using a tree database, and Cleary compression, on GPUs. Experiments show processing speeds of up to 131 million states per second.

Originele taal-2Engels
TitelTools and Algorithms for the Construction and Analysis of Systems - 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Proceedings
RedacteurenSriram Sankaranarayanan, Natasha Sharygina
Pagina's684-703
Aantal pagina's20
DOI's
StatusGepubliceerd - 2023

Publicatie series

NaamLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13993 LNCS
ISSN van geprinte versie0302-9743
ISSN van elektronische versie1611-3349

Vingerafdruk

Duik in de onderzoeksthema's van 'A GPU Tree Database for Many-Core Explicit State Space Exploration'. Samen vormen ze een unieke vingerafdruk.

Citeer dit