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.
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