Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
COHESION - A microkernel based Desktop Grid platform for irregular task-parallel applications
Future Generation Computer Systems
Strategies for Solving SAT in Grids by Randomized Search
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Incorporating Learning in Grid-Based Randomized SAT Solving
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
A distribution method for solving SAT in grids
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Towards autonomic management for Cloud services based upon volunteered resources
Concurrency and Computation: Practice & Experience
An overview of parallel SAT solving
Constraints
| Hi-index | 0.00 |
ZetaSAT is a research effort to enable efficient parallel Boolean satisfiability (SAT) solving on the Desktop Grid. ZetaSAT is based on the Desktop Grid platform Zeta-Grid. Our work particularly addresses specific issues arising when executing constraint satisfaction problems of the kind of SAT in Desktop Grids, like dynamic problem decomposition, load balancing, termination detection, and domain specific fault tolerance. We report on performance measurements indicating the usefulness of our approach.