|
Upravlenie Bol'shimi Sistemami, 2013, Issue 43, Pages 138–156
(Mi ubs678)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Information Technology Applications in Control
Constructing decomposition sets for distributed solution of sat problems in volunteer computing project sat@home
O. S. Zaikina, A. A. Semenova, M. A. Posypkinb a Institute for System Dynamics and Control Theory of SB RAS
b Institute for Information Transmission Problems of RAS
Abstract:
We suggest an approach to construct decomposition sets for coarse-grained parallelization of SAT problems. Decomposition sets are used for distributed solving of hard SAT problems. The proposed algorithms are used in the volunteer computing project SAT@home.
Keywords:
Boolean satisfiability problem, simulated annealing, volunteer computing, SAT@home.
Citation:
O. S. Zaikin, A. A. Semenov, M. A. Posypkin, “Constructing decomposition sets for distributed solution of sat problems in volunteer computing project sat@home”, UBS, 43 (2013), 138–156
Linking options:
https://www.mathnet.ru/eng/ubs678 https://www.mathnet.ru/eng/ubs/v43/p138
|
Statistics & downloads: |
Abstract page: | 310 | Full-text PDF : | 89 | References: | 62 | First page: | 2 |
|