Saturation NOW

Authors:
Ming-Ying Chung;Gianfranco Ciardo
Affiliations:
University of California, Riverside;University of California, Riverside
Venue:
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Year:
2004

Citing 0
Cited 7

A Database Approach to Distributed State Space Generation

Electronic Notes in Theoretical Computer Science (ENTCS)
Measuring and Evaluating Parallel State-Space Exploration Algorithms

Electronic Notes in Theoretical Computer Science (ENTCS)
A Pattern Recognition Approach for Speculative Firing Prediction in Distributed Saturation State-Space Generation

Electronic Notes in Theoretical Computer Science (ENTCS)
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
A dynamic firing speculation to speedup distributed symbolic state-space generation

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Multi-Core BDD Operations for Symbolic Reachability

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a distributed version of the saturation algorithm for symbolic state-space generation of discrete-state models. The execution is strictly sequential but utilizes the overall available memory. Thanks to a level-based allocation of the decision diagram nodes onto the workstations, no additional node or work is created. A dynamic memory load balancing heuristic helps coping with the uneven growth of the decision diagram levels allocated to each workstation. Experiments on a conventional network of workstations show that the runtime of our distributed implementation is close to the sequential one even when balancing is triggered, while it is of course much better when the sequential implementation is forced to rely on virtual memory.