Publication details
Shared Hash Tables in Parallel Model Checking
| Basic information | |
|---|---|
| Original title: | Shared Hash Tables in Parallel Model Checking |
| Authors: | Jiří Barnat, Petr Ročkai |
| Further information | |
|---|---|
| Citation: | BARNAT, Jiří - ROČKAI, Petr. Shared Hash Tables in Parallel Model Checking. CTIT Workshop Proceedings, University of Twente, CTIT, Germany. ISSN 0929 -0672, 2007, vol. 2007, no. WP 07 -04, pp. 81 -95. |
| Original language: | English |
| Field: | Informatika |
| Type: | Article in Periodical |
| Keywords: | Hash tables; locking schemes; parallel |
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.
Related projects:
- Techniques for automatic verification and validation of software nad hardware systems
- Institute for Theoretical Computer Science
- Highly Parallel and Distributed Computing Systems
- Automated software verification











