Journal article

Cache Conscious Data Structures for Boolean Satisfiability Solvers

GG CHU, A HARWOOD, P STUCKEY

Journal of Satisfiability, Boolean Modeling and Computation | IOS Press | Published : 2010

Abstract

Current SAT solvers are well engineered and highly efficient, and significant research effort has been put into creating data structures that can produce maximal efficiency for the core propagation engine within SAT solvers. However, there is still substantial room for improvement. As the disparity between CPU speeds and cache sizes have increased, cache conscious data structures and algorithms have become very important. They are even more important in the context of parallel SAT solving, as issues like cache contention and main memory contention can dramatically slow down a parallel SAT solver. We present a series of data structure and algorithmic modifications that are able to increase th..

View full abstract