2019 年 139 巻 2 号 p. 119-126
The satisfiability (SAT) problem is widely applicable to various industrial problems, such as formal verification of industrial systems. This study presents the performance evaluation of a parallel SAT solver (Glucose Syrup) on Intel Xeon Phi many-core processors. After limiting the number of learnt clauses to be shared, the number of solved problems in the SAT Competition 2016 workload increased from 201 to 236, yet it was smaller than that of a Xeon processor.
J-STAGEがリニューアルされました!https://www.jstage.jst.go.jp/browse/-char/ja/