Abstract
We present a parallel solver for the propositional satisfiability problem called PICHAFF. The algorithm is an adaption of the state-of-the-art solver CHAFF optimised for a scalable, dynamically reconfigurable multiprocessor system based on Microchip PIC microcontrollers. PICHAFF includes lazy clause evaluation, conflict driven learning, non-chronological backtracking, clause deletion, and early conflict detection, all of them adapted to the environment considered. For the parallel execution Dynamic Search Space Partitioning is incorporated to divide the search space into disjoint portions to be treated in parallel. We demonstrate the feasibility of our approach by a set of experiments on a multiprocessor system containing 9 Microchip PIC17C43 microcontrollers.
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
Zhang, H.: SATO: An efficient propositional prover. In: International Conference on Automated Deduction (1997)
Marques-Silva, J., Sakallah, K.: GRASP - a new search algorithm for satisfiability. In: International Conference on CAD (1996)
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Design Automation Conference (2001)
Blochinger, W., Sinz, C., Küchlin, W.: Parallel propositional satisfiability checking with distributed dynamic learning. In: Parallel Computing (2003)
Zhang, H., Bonacina, M., Hsiang, J.: PSATO: a distributed propositional prover and its application to quasigroup problems. Journal of Symbolic Computation (1996)
Böhm, M., Speckenmeyer, E.: A fast parallel SAT-solver - efficient workload balancing. In: Annals of Mathematics and Artificial Intelligence (1996)
Zhao, Y., Malik, S., Moskewicz, M., Madigan, C.: Accelerating Boolean satisfiability through application specific processing. In: 14th International Symposium on System Synthesis (2001)
Drechsler, R., Drechsler, N., Mackensen, E., Schubert, T., Becker, B.: Design reuse by modularity: A scalable dynamical (re)configurable multiprocessor system. In: 26th Euromicro Conference (2000)
Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in a Boolean satisfiability solver. In: International Conference on CAD (2001)
Lewis, M., Schubert, T., Becker, B.: Early conflict detection based SAT solving. In: 7th International Conference on Theory and Applications of Satisfiability Testing, SAT 2004 (2004)
Zhang, L., Malik, S.: Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In: Design, Automation, and Test in Europe (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schubert, T., Becker, B. (2004). Parallel SAT Solving with Microcontrollers. In: Manandhar, S., Austin, J., Desai, U., Oyanagi, Y., Talukder, A.K. (eds) Applied Computing. AACC 2004. Lecture Notes in Computer Science, vol 3285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30176-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-30176-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23659-7
Online ISBN: 978-3-540-30176-9
eBook Packages: Springer Book Archive