EEMCS

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

EEMCS EPrints Service


20337 Multi-Core Nested Depth-First Search
Home Policy Brochure Browse Search User Area Contact Help

Laarman, A.W. and Langerak, R. and van de Pol, J.C. and Weber, Michael and Wijs, A. (2011) Multi-Core Nested Depth-First Search. In: Proceedings of the 9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011, 11-14 Oct 2011, Tapei, Taiwan. pp. 321-335. Lecture Notes in Computer Science 6996. Springer Verlag. ISBN 978-3-642-24372-1

Full text available as:

PDF

905 Kb
Open Access



Official URL: http://dx.doi.org/10.1007/978-3-642-24372-1_23

Exported to Metis

Abstract

The LTL Model Checking problem is reducible to finding accepting cycles in a graph. The Nested Depth-First Search (NDFS) algorithm detects accepting cycles efficiently: on-the-fly, with linear-time complexity and negligible memory overhead. The only downside of the algorithm is that it relies on an inherently-sequential, depth-first search. It has not been parallelized beyond running the independent nested search in a separate thread (dual core).
In this paper, we introduce, for the first time, a multi-core NDFS algorithm that can scale beyond two threads, while maintaining exactly the same worst-case time complexity. We prove this algorithm correct, and present experimental results obtained with an implementation in the LTSmin tool set on the entire BEEM benchmark database. We measured considerable speedups compared to the current state of the art in parallel cycle detection algorithms.

Item Type:Conference or Workshop Paper (Full Paper, 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:Parallel, Multi-Core, Nested DFS, Emptyness Problem, Cycle Detection, Model Checking, LTL
ID Code:20337
Status:Published
Deposited On:25 July 2011
Refereed:Yes
International:Yes
More Information:statisticsmetis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item