Scalable parallel solver of boolean satisfiability problems

One of the current trends in high-performance computing (HPC) is applying its possibilities to solve the Boolean satisfiability problem (SAT). SAT is the fundamental problem of mathematical logic and the computational theory. Many of the most important Data and Life Sciences problems can be formulat...

Full description

Saved in:

Bibliographic Details
Published in:	2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO) pp. 0222 - 0227
Main Authors:	Bogdanova, V. G., Gorsky, S. A.
Format:	Conference Proceeding
Language:	English
Published:	Croatian Society MIPRO 01.05.2018
Subjects:	Boolean satisfiability problem cooperative approach high-performance computing parallel SAT solver Scalability
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	One of the current trends in high-performance computing (HPC) is applying its possibilities to solve the Boolean satisfiability problem (SAT). SAT is the fundamental problem of mathematical logic and the computational theory. Many of the most important Data and Life Sciences problems can be formulated as SAT, in particular, the Regulation in Animals and Plants problem in Bioinformatics. Traditionally two approaches to the parallel solution of SAT are used, competitive and cooperative. We propose a new massive parallel SAT solver Hpcsat implemented using MPI technology based on the second approach. We describe the architecture and functionality of the solver and the toolkit for automation of the computational experiments process. The approving Hpcsat scalability results of computational experiments are represented. The results of the offered solver confirmed the advantage of Hpcsat in comparing with the existing analogous massive parallel HordeSat solver.
DOI:	10.23919/MIPRO.2018.8400042