GridSAT: Design and Implementation of a Computational Grid Application

We present the latest instantiation of GridSAT [1], a distributed and complete satisfiability solver that is explicitly designed to aggregate Grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the u...

Full description

Saved in:
Bibliographic Details
Published inJournal of grid computing Vol. 4; no. 2; pp. 177 - 193
Main Authors Chrabakh, Wahid, Wolski, Rich
Format Journal Article
LanguageEnglish
Published Dordrecht Springer Nature B.V 01.06.2006
Subjects
Computational grids
Innovations
Migration
Resource scheduling
Solvers
State of the art
Workstations
Online AccessGet full text

Cover

More Information
Summary:We present the latest instantiation of GridSAT [1], a distributed and complete satisfiability solver that is explicitly designed to aggregate Grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the unprecedented solving power GridSAT enables through algorithmic and implementation innovations. We describe the implementation techniques that allow GridSAT to leverage a variety of high-end batch-scheduled resources, clusters, interactive workstations, and personal computing resources through autonomous scheduling, checkpoint scheduling, and work migration. These innovations have allowed GridSAT to solve a set of ‘hard’ and previously unsolved industrial and community satisfiability problems. In addition to this new solution power, GridSAT also outperforms the otherwise highest performance general solvers on the annual SAT competition [21] performance benchmarks.
ISSN:1570-7873
1572-9184
DOI:10.1007/s10723-006-9042-8