DocumentCode
2776739
Title
ZetaSAT - Boolean SATisfiability solving on Desktop Grids
Author
Blochinger, Wolfgang ; Westje, Wolfgang ; Küchlin, Wolfgang ; Wedeniwski, Sebastian
Author_Institution
Symbolic Comput. Group, Tubingen Univ., Germany
Volume
2
fYear
2005
fDate
9-12 May 2005
Firstpage
1079
Abstract
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.
Keywords
Boolean algebra; computability; constraint theory; grid computing; mathematics computing; parallel processing; Desktop Grid; Zeta-Grid; ZetaSAT; constraint satisfaction problem; domain specific fault tolerance; dynamic problem decomposition; load balancing; parallel Boolean satisfiability; termination detection; Collaboration; Computer networks; Concurrent computing; Fault detection; Fault tolerance; Grid computing; High performance computing; Load management; Measurement; World Wide Web;
fLanguage
English
Publisher
ieee
Conference_Titel
Cluster Computing and the Grid, 2005. CCGrid 2005. IEEE International Symposium on
Print_ISBN
0-7803-9074-1
Type
conf
DOI
10.1109/CCGRID.2005.1558680
Filename
1558680
Link To Document