- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- 【Updated on June 30, 2025】Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Mixed Parallel Execution of Algorithms for Satisfiability Problem
DOI
Open Access
Description
LPPH has been proposed to solve the satisfiability problem (SAT). In order to solve the SAT more efficiently, a parallel execution has been proposed. Experimental results show that higher speedup ratio is obtained by using this parallel execution of the LPPH. In this paper, we propose a method of mixed parallel execution of several algorithms for the SAT. "Mixed" means the parallel execution of the LPPH and local search algorithms. In the experiments, we used the LPPH with attenuation coefficient generating function and the GSAT. Results of experiments show mixing these two algorithms yield excellent performance.