Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms

  • Lintao Zhang
  • Sharad Malik
Conference paper

DOI: 10.1007/978-3-540-24605-3_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2919)
Cite this paper as:
Zhang L., Malik S. (2004) Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms. In: Giunchiglia E., Tacchella A. (eds) Theory and Applications of Satisfiability Testing. SAT 2003. Lecture Notes in Computer Science, vol 2919. Springer, Berlin, Heidelberg

Abstract

We experimentally evaluate the cache performance of different SAT solvers as a case study for the efficient implementation of SAT algorithms. We evaluate several different Boolean Constraint Propagation (BCP) mechanisms and show their respective run time and cache performances on selected benchmark instances. From the experiments we conclude that a cache friendly data structure is a key element in the efficient implementation of SAT solvers. We also show empirical cache miss rates of several modern SAT solvers based on the Davis-Logemann-Loveland (DLL) algorithm with learning and non-chronological backtracking. We conclude that the recently developed SAT solvers are much more cache friendly in data structures and algorithm implementations compared with their predecessors.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Lintao Zhang
    • 1
  • Sharad Malik
    • 2
  1. 1.Microsoft ResearchMountain ViewUSA
  2. 2.Department of Electrical EngineeringPrinceton UniversityPrincetonUSA

Personalised recommendations