SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Implementation of an efficient parallel BDD package
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Programming with POSIX threads
Programming with POSIX threads
The implementation of the Cilk-5 multithreaded language
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Cluster computing: the commodity supercomputer
Software—Practice & Experience
A probabilistic dynamic technique for the distributed generation of very large state spaces
Performance Evaluation - Special issue on modelling techniques and tools for performance evaluation
Parallelizing the Murϕ Verifier
Formal Methods in System Design - Special issue on CAV '97
Parallel state space construction for model-checking
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Introduction to Parallel Computing
Introduction to Parallel Computing
Local Parallel Model Checking for the Alternation-Free µ-Calculus
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Regular versus Irregular Problems and Algorithms
IRREGULAR '95 Proceedings of the Second International Workshop on Parallel Algorithms for Irregularly Structured Problems
BDDNOW: A Parallel BDD Package
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Saturation: An Efficient Iteration Strategy for Symbolic State-Space Generation
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Distributing Timed Model Checking - How the Search Order Matters
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
CTL* model checking on a shared-memory architecture
Formal Methods in System Design
Can saturation be parallelised?: on the parallelisation of a symbolic state-space generator
FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Parallelising symbolic state-space generators
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Achieving speedups in distributed symbolic reachability analysis through asynchronous computation
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Parallel and Distributed Invariant Checking of Microcontroller Software
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We argue in this paper that benchmarking should be complemented by direct measurement of parallelisation overheads when evaluating parallel state-space exploration algorithms. This poses several challenges that so far have not been addressed in the literature: what exactly are those overheads, how can and cannot they be measured, and how should system models be selected in order to expose the causes of parallelisation (in)efficiencies? We discuss and answer these questions based on our experience with parallelising Saturation - a symbolic algorithm for generating state-spaces of asynchronous system models - on a shared-memory architecture. Doing so will hopefully spare newcomers to the growing PDMC community from having to learn these lessons the hard way, as we did over a painful period of almost three years.