Страница публикации

Scalable parallel solver of boolean satisfiability problems

Тип публикации: Материал конференции

Тип материала: Текст

Авторы: Bogdanova V.G., Gorsky S.A.

Журнал: Proc. 41st Intern. Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO 2018)

Язык публикации: english

Номера страниц: 222-227

Количество страниц: 6

Год публикации: 2018

Отчетный год: 2018

DOI: 10.23919/MIPRO.2018.8400042

Аннотация: 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.

Индексируется WOS: Нет

Индексируется Scopus: Нет

Индексируется УБС: Нет

Индексируется РИНЦ: Да

Индексируется ВАК: Нет

Индексируется CORE: Нет