Multi-core nested depth-first search

  • Authors:

  • Alfons Laarman;Rom Langerak;Jaco Van De Pol;Michael Weber;Anton Wijs

  • Affiliations:

  • Formal Methods and Tools, University of Twente, The Netherlands;Formal Methods and Tools, University of Twente, The Netherlands;Formal Methods and Tools, University of Twente, The Netherlands;Formal Methods and Tools, University of Twente, The Netherlands;Eindhoven University of Technology, Eindhoven, The Netherlands

  • Venue:
  • ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.