Repository logo
Article

Using BOINC desktop grid to solve large scale SAT problems

Thumbnail Image
DOI: https://doi.org/10.7494/csci.2012.13.1.25 

Files

cs2012_13_01_025.pdf (462.96 KB)

Date

2012

Presentation Date

Editor

Authors

Other contributors

Access rights

Access: otwarty dostęp
Rights: CC BY 4.0
Attribution 4.0 International

Attribution 4.0 International (CC BY 4.0)

Other title

Resource type

artykuł

Version

wersja wydawnicza
thumbnail.journal.alt
Item type:Journal Issue,
Computer Science
2012 - Vol. 13 - No. 1

Pagination/Pages:

pp. 25-34

Research Project

Event

Description

Bibliogr. s. 32-33.

Keywords

desktop grid, Boolean satisfiability problem (SAT), SAT, volunteer computing, BOINC

Abstract

Many practically important combinatorial problems can be efficiently reduced to a problem of Boolean satisfiability (SAT). Therefore, the implementation of distributed algorithms for solving SAT problems is of great importance. In this article we describe a technology for organizing desktop grid, which is meant for solving SAT problems. This technology was implemented in the form of a volunteer computing project SAT@home based on a popular BOINC platform.

Access rights

Access: otwarty dostęp
Rights: CC BY 4.0
Attribution 4.0 International

Attribution 4.0 International (CC BY 4.0)

URI

https://repo.agh.edu.pl/handle/AGH/48692

Collections

Artykuły (CN-csci)