Shared Hash Tables in Parallel Model Checking

12Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

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. © 2008 Elsevier B.V. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Barnat, J., & Ročkai, P. (2008). Shared Hash Tables in Parallel Model Checking. Electronic Notes in Theoretical Computer Science, 198(1), 79–91. https://doi.org/10.1016/j.entcs.2007.10.021

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free