ZetaSAT – Boolean satisfiability solving on desktop grids. 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 for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Balyo, Tomáš; Sanders, Peter; Sinz, Carsten: HordeSat: a massively parallel portfolio SAT solver (2015)
- Martins, Ruben; Manquinho, Vasco; Lynce, In^es: An overview of parallel SAT solving (2012)
- Schulz, Sven; Blochinger, Wolfgang: Parallel SAT solving on peer-to-peer desktop grids (2010) ioport
- Schulz, Sven; Blochinger, Wolfgang; Poths, Mathias: Orbweb-A network substrate for peer-to-peer desktop grid computing based on open standards (2010) ioport
- Hyvärinen, Antti E.J.; Junttila, Tommi; Niemelä, Ilkka: Strategies for solving SAT in grids by randomized search (2008)
- Chrabakh, Wahid; Wolski, Rich: GridSAT: Design and implementation of a computational grid application (2006)
- Chrabakh, Wahid; Wolski, Rich: GridSAT: Design and implementation of a computational grid application (2006) ioport