Academic Journal
MallobSat: Scalable SAT Solving by Clause Sharing.
| Τίτλος: | MallobSat: Scalable SAT Solving by Clause Sharing. |
|---|---|
| Συγγραφείς: | Schreiber, Dominik, Sanders, Peter |
| Πηγή: | Journal of Artificial Intelligence Research; 2024, Vol. 80, p1437-1495, 59p |
| Θεματικοί όροι: | Scalability, Parallel processing, Iterative methods (Mathematics), Distributed computing, Electronic data processing |
| Περίληψη: | SAT solving in large distributed environments has previously led to some famous results and to impressive speedups for selected inputs. However, in terms of general-purpose SAT solving, prior approaches still cannot make efficient use of a large number of processors. We aim to address this issue with a complete and systematic overhaul of the distributed solver HordeSat with a focus on its algorithmic building blocks. In particular, we present a communication-efficient approach to clause sharing, careful buffering and filtering of produced clauses, and effective orchestration of state-of-the-art solver backends. In extensive evaluations, our approach named MallobSat significantly outperforms an updated HordeSat, doubling its mean speedup. Our clause sharing results in effective parallelization even if all threads execute identical solver programs that only differ based on which clauses they import at which times. We thus argue that MallobSat is not a portfolio solver with the added bonus of clause sharing but rather a clause-sharing solver where adding some explicit diversification is useful but not essential. We also discuss the last four iterations of the International SAT Competition (2020–2023), where our system ranked very favorably, and identify several previously unsolved competition problems that MallobSat solved successfully. Last but not least, our approach is malleable, i.e., supports running on a fluctuating set of resources, which allows us to combine parallel job processing and parallel SAT solving in a flexible manner for best resource efficiency. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Artificial Intelligence Research is the property of AI Access Foundation and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Complementary Index |
καταχωρήστε σχόλιο πρώτοι!