EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


20618 Variations on Multi-Core Nested Depth-First Search
Home Policy Brochure Browse Search User Area Contact Help

Laarman, A.W. and van de Pol, J.C. (2011) Variations on Multi-Core Nested Depth-First Search. (Invited) In: Proceedings of the 10th International Workshop on Parallel and Distributed Methods in verifiCation, PDMC 2011, 14 Jul 2011, Snowbird, Utah. pp. 13-28. Electronic Proceedings in Theoretical Computer Science 72. EPTCS. ISSN 2075-2180

Full text available as:

PDF

1443 Kb
Open Access



Official URL: http://dx.doi.org/10.4204/EPTCS.72.2

Exported to Metis

Abstract

Recently, two new parallel algorithms for on-the-fly model checking of LTL properties were presented at the same conference: Automated Technology for Verification and Analysis, 2011. Both approaches extend Swarmed NDFS, which runs several sequential NDFS instances in parallel. While parallel random search already speeds up detection of bugs, the workers must share some global information in order to speed up full verification of correct models. The two algorithms differ considerably in the global information shared between workers, and in the way they synchronize.
Here, we provide a thorough experimental comparison between the two algorithms, by measuring the runtime of their implementations on a multi-core machine. Both algorithms were implemented in the same framework of the model checker LTSmin, using similar optimizations, and have been subjected to the full BEEM model database.
Because both algorithms have complementary advantages, we constructed an algorithm that combines both ideas. This combination clearly has an improved speedup. We also compare the results with the alternative parallel algorithm for accepting cycle detection OWCTY-MAP. Finally, we study a simple statistical model for input models that do contain accepting cycles. The goal is to distinguish the speedup due to parallel random search from the speedup that can be attributed to clever work sharing schemes.

Item Type:Conference or Workshop Paper (Full Paper, Invited/Keynote Talk)
Research Group:EWI-FMT: Formal Methods and Tools
Research Program:CTIT-DSN: Dependable Systems and Networks
Research Project:CEDICT: 3TU Center of Excellence for ICT
Uncontrolled Keywords:multi-core, ltl model checking, parallel, nested dfs, depth first search, swarmed
ID Code:20618
Status:Published
Deposited On:11 October 2011
Refereed:No
International:Yes
More Information:statisticsmetis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item