Shared Hash Tables in Parallel Model Checking

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. Key words: Hash tables, locking schemes, parallel

• Type: Journal
• Year: 2008
• Where: ENTCS
• Authors: Jiri Barnat, Petr Rockai
• Keywords: Distributed Memory, ENTCS 2008, ENTCS 2010, Hash Tables, Parallel Explicit Model