loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2
ZetaSAT - Boolean SATisfiability solving on Desktop Grids
Cardiff, Wales, UK
May 09-May 12
ISBN: 0-7803-9074-1
ASCII Text
x 
 
W. Blochinger, W. Westje, W. Kuchlin, S. Wedeniwski, "ZetaSAT - Boolean SATisfiability solving on Desktop Grids," Cluster Computing and the Grid, IEEE International Symposium on, vol. 2, pp. 1079-1086, Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2, 2005.
 
 
BibTex
x
 
@article{ 10.1109/CCGRID.2005.1558680,
author = {W. Blochinger and W. Westje and W. Kuchlin and S. Wedeniwski},
title = {ZetaSAT - Boolean SATisfiability solving on Desktop Grids},
journal ={Cluster Computing and the Grid, IEEE International Symposium on},
volume = {2},
year = {2005},
isbn = {0-7803-9074-1},
pages = {1079-1086},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCGRID.2005.1558680},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Cluster Computing and the Grid, IEEE International Symposium on
TI - ZetaSAT - Boolean SATisfiability solving on Desktop Grids
SN - 0-7803-9074-1
SP1079
EP1086
A1 - W. Blochinger,
A1 - W. Westje,
A1 - W. Kuchlin,
A1 - S. Wedeniwski,
PY - 2005
VL - 2
JA - Cluster Computing and the Grid, IEEE International Symposium on
ER -
 
W. Blochinger, Symbolic Comput. Group, Tubingen Univ., Germany
W. Westje, Symbolic Comput. Group, Tubingen Univ., Germany
W. Kuchlin, Symbolic Comput. Group, Tubingen Univ., Germany
S. Wedeniwski, Instituto de Informatica, Univ. Fed. do Rio Grande do Sul, Porto Alegre, Brazil
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.
Citation:
W. Blochinger, W. Westje, W. Kuchlin, S. Wedeniwski, "ZetaSAT - Boolean SATisfiability solving on Desktop Grids," ccgrid, vol. 2, pp.1079-1086, Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2, 2005
Usage of this product signifies your acceptance of the Terms of Use.