Shared Hash Tables in Parallel Model Checking

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

Authors	BARNAT Jiří ROČKAI Petr
Year of publication	2008
Type	Article in Periodical
Magazine / Source	Electronic Notes in Theoretical Computer Science
MU Faculty or unit	Faculty of Informatics
Citation
Field	Informatics
Keywords	Hash tables; locking schemes; parallel
Description	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