World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Spring Sale: Get 35% off with a min. purchase of 2 titles. Use code SPRING35. Valid till 31st Mar 2025.

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

An effective parallel algorithm based on GPU for 3-SAT

    https://doi.org/10.1142/9789811223334_0178Cited by:0 (Source: Crossref)
    Abstract:

    SAT problem solving plays an important role in the field of industrial applications. Most of the problems of SAT competitions come from industry. However, the problems of industrial applications are large in scale and it takes a long time to deal with them. This paper introduces the research progress of SAT problem solving algorithm based on hardware acceleration. Secondly, a GPU based Boolean Constraint Propagation algorithm is implemented based on the 3-SAT-DC algorithm, and a clause-literal association structure for GPU is designed. CUDA programming model is used to design and implement the algorithm. Experimental results show that the new 3-SAT-DC algorithm is better than the original algorithm.