Abstract
This paper proposes a massive parallel Max-Sat solver based on speculative computation using GPUs. Max-SAT is a combinatorial optimization problem that maximizes the true clauses of the SAT clauses, and many Max-SAT solvers have been proposed. Parallelization is expected as an efficiency improvement method when solving problems with a large amount of computation such as Max-SAT. However, many of the Max-SAT solvers are designed as sequential programs, and the effect of parallelization is limited. In this study, we developed a massive parallel search algorithm by designing a parallel stochastic search algorithm and combining it with parallel speculative computation. From the comparison with existing solvers using the Max-SAT problem, we examine the feasibility of this method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
