Shared Hash Tables in Parallel Model Checking | Zendy

Jǐŕı Barnat | Zendy; Petr Ročkai | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Shared Hash Tables in Parallel Model Checking

Author(s) -

Jǐŕı Barnat,

Petr Ročkai

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.10.021

Subject(s) - computer science , shared memory , hash table , hash function , parallel computing , distributed shared memory , distributed memory , model checking , state (computer science) , state space , distributed computing , theoretical computer science , memory management , uniform memory access , algorithm , programming language , overlay , mathematics , statistics

In light of recent shift towards shared-memory systems in parallel explicit model checking, we explore relative advantages and disadvantages of shared versus private hash tables. Since usage of shared state storage allows for techniques unavailable in distributed memory, these are evaluated, both theoretically and practically, in a prototype implementation. Experimental data is presented to assess practical utility of those techniques, compared to static partitioning of state space, more traditional in distributed memory algorithms

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research