Reproducible Efficient Parallel SAT Solving
Reproducible Efficient Parallel SAT Solving
复制标题
DOI:
10.1007/978-3-030-51825-7_10
复制
发表时间:
2020-06-26
期刊:
影响因子:
--
通讯作者:
Inoue K
中科院分区:
文献类型:
--
作者:
Nabeshima H;Inoue K
In this paper, we propose a new reproducible and efficient parallel SAT solving algorithm. Unlike sequential SAT solvers, most parallel solvers do not guarantee reproducible behavior due to maximizing the performance. The unstable and non-deterministic behavior of parallel SAT solvers hinders a wider adoption of parallel solvers to the practical applications. In order to achieve robust and efficient parallel SAT solving, we propose two techniques to significantly reduce idle time in deterministic parallel SAT solving: delayed clause exchange and accurate estimation of execution time of clause exchange interval between solvers. The experimental results show that our reproducible parallel SAT solver has comparable performance to non-deterministic parallel SAT solvers even in a many-core environment.
影响因子:
0.7
作者:
Zhang, HT;Bonacina, MP;Hsiang, J
通讯作者:
Hsiang, J
DOI:
10.1111/j.1467-9868.2005.00503.x
发表时间:
2005-01-01
影响因子:
5.8
作者:
Zou, H;Hastie, T
通讯作者:
Hastie, T
DOI:
10.1142/s0218213015500050
发表时间:
2015-06-01
影响因子:
1.1
作者:
Martins, Ruben;Manquinho, Vasco;Lynce, Ines
通讯作者:
Lynce, Ines