Abstract
The paper discusses cache utilization in state-of-the-art SAT solvers. The aim of the study is to show how a resource-unaware SAT solver can be improved by utilizing the cache sensibly. The analysis is performed on a CDCL-based SAT solver using a subset of the industrial SAT Competition 2009 benchmark. For the analysis, the total cycles, the resource stall cycles, the L2 cache hits and the L2 cache misses are traced using sample based profiling. Based on the analysis, several techniques – some of which have not been used in SAT solvers so far – are proposed resulting in a combined speedup up to 83% without affecting the search path of the solver. The average speedup on the benchmark is 60%. The new techniques are also applied to MiniSAT2.0 improving its runtime by 20% on average.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
HPCToolkit, http://hpctoolkit.org/
ICCL SAT project group, http://www.wv.inf.tu-dresden.de/Research/SATSolving/
PAPI library, http://icl.cs.utk.edu/papi/
Baldow, C., Gräter, F., Hölldobler, S., Manthey, N., Seelemann, M., Steinke, P., Wernhard, C., Winkler, K., Zenker, E.: HydraSAT 2009.3 solver description. SAT 2009 Competitive Event Booklet, http://www.cril.univ-artois.fr/SAT09/solvers/booklet.pdf
Béjar, R., Manyà, F.: Solving the round robin problem using propositional logic. In: Procs. 17th National Conf. on Artificial Intelligence and 12th Conf. on Innovative Applications of Artificial Intelligence (2000)
Bonwick, J.: The slab allocator: an object-caching kernel memory allocator. In: Proceedings of the USENIX Summer 1994 Technical Conference (1994)
Chu, G., Harwood, A., Stuckey, P.J.: Cache conscious data structures for boolean satisfiability solvers. JSAT 6, 99–120 (2009)
Cook, S.A.: The complexity of theorem-proving procedures. In: Procs. 3rd Annual ACM Symposium on Theory of Computing (1971)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7), 394–397 (1962)
Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, Springer, Heidelberg (2004)
Eén, N., Sörensson, N.: MiniSAT - a SAT solver with conflict-clause minimization. In: Poster - 8th SAT (2005)
Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: SAT solving for termination analysis with polynomial interpretations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, Springer, Heidelberg (2007)
Hennessy, J., Patterson, D.: Computer Architecture - A Quantitative Approach. Morgan Kaufmann, San Francisco (1996)
Kautz, H., Selman, B.: Planning as satisfiability. In: Procs. 10th European Conference on Artificial Intelligence (1992)
Lynce, I., Marques-Silva, J.: SAT in bioinformatics: making the case with haplotype inference. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, Springer, Heidelberg (2006)
Manthey, N.: riss 2010 solver description. SAT Race (2010) (submitted to), http://www.ki.inf.tu-dresden.de/~norbert/webdata/data/riss-short.pdf
Manthey, N., Saptawijaya, A.: Towards improving the resource usage of SAT-solvers. In: Pragmatics of SAT Workshop (2010) (to appear)
Marques-Silva, J.P., Sakallah, K.A.: GRASP: A new search algorithm for satisfiability. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102. Springer, Heidelberg (1996)
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Design Automation Conference, pp. 530–535 (2001)
Pipatsrisawat, K., Darwiche, A.: RSat solver description for SAT competition, SAT, Competitive Event Booklet (2009), http://www.cril.univ-artois.fr/SAT09/solvers/booklet.pdf
Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501. Springer, Heidelberg (2007)
Ryan, L.O.: Efficient algorithms for clause learning SAT solvers. Master’s thesis, Simon Fraser University, Canada (2004)
Sörensson, N., Eén, N.: MiniSAT 2.1 and MiniSAT++ 1.0 - SAT race, editions. SAT, Competitive Event Booklet (2008), http://www.cril.univ-artois.fr/SAT09/solvers/booklet.pdf
van Gelder, A.: Generalizations of watched literals for backtracking search. In: Seventh International Symposium on AI and Mathematics (2002)
Zhang, L., Malik, S.: Cache performance of SAT solvers: a case study for efficient implementation of algorithms. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 287–298. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hölldobler, S., Manthey, N., Saptawijaya, A. (2010). Improving Resource-Unaware SAT Solvers. In: Fermüller, C.G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2010. Lecture Notes in Computer Science, vol 6397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16242-8_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-16242-8_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16241-1
Online ISBN: 978-3-642-16242-8
eBook Packages: Computer ScienceComputer Science (R0)