Solving Sat in a Distributed Cloud: A Portfolio Approach

Audemard, G., Hoessen, B., Jabbour, S., Lagniez, J.-M. and Piette, C. (2012). PeneLoPe, a parallel clause-freezer solver, SAT Challenge 2012: Solver and Benchmarks Descriptions, Helsinki, Finland, pp. 43–44.Search in Google Scholar

Audemard, G., Hoessen, B., Jabbour, S. and Piette, C. (2014). Dolius: A distributed parallel SAT solving framework, 5th Pragmatics of SAT Workshop POS-14, Vienna, Austria, pp. 1–11.Search in Google Scholar

Biere, A. (2010). Lingeling, plingeling, PicoSAT and PrecoSAT at SAT Race 2010, Technical report, Johannes Kepler University, Linz.Search in Google Scholar

Chrabakh, W. and Wolski, R. (2003). Gridsat: A Chaff-based distributed SAT solver for the grid, Proceedings of the 2003 ACM/IEEE Conference on Supercomputing, SC’03, Phoenix, AZ, USA, pp. 37–50, DOI: 10.1145/1048935.1050188.10.1145/1048935.1050188Search in Google Scholar

Goldman, A., Ngoko, Y. and Trystram, D. (2012). Malleable resource sharing algorithms for cooperative resolution of problems, Congress on Evolutionary Computation World Congress on Computational Intelligence, Brisbane, Australia, pp. 1438–1445.10.1109/CEC.2012.6256524Search in Google Scholar

Hochbaum, D.S. and Pathria, A. (1998). Analysis of the greedy approach in problems of maximum k-coverage, Naval Research Logistics45(6): 615–627.10.1002/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5Search in Google Scholar

Holldobler, S., Manthey, N., Nguyen, V.H., Stecklina, J. and Steinke, P. (2011). A short overview on modern parallel SAT-solvers, 2011 International Conference on Advanced Computer Science and Information System (ICACSIS), Jakarta, Indonesia, pp. 201–206.Search in Google Scholar

Jackson, P. and Sheridan, D. (2005). Clause form conversions for boolean circuits, Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing, SAT’04, Vancouver, BC, Canada, pp. 183–198.10.1007/11527695_15Search in Google Scholar

Kautz, H. and Selman, B. (2007). The state of SAT, Discrete Applied Mathematics155(12): 1514–1524.10.1016/j.dam.2006.10.004Search in Google Scholar

Martins, R., Manquinho, V. and Lynce, I. (2012). An overview of parallel SAT solving, Constraints17(3): 304–347.10.1007/s10601-012-9121-3Search in Google Scholar

Ngoko, Y., Saintherant, N., Cérin, C. and Trystram, D. (2018). Invited paper: How future buildings could redefine distributed computing, 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPS 2018, Vancouver, BC, Canada, pp. 1232–1240.10.1109/IPDPSW.2018.00192Search in Google Scholar

Ngoko, Y., Trystram, D., Reis, V. and Cérin, C. (2016). An automatic tuning system for solving NP-hard problems in clouds, 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPS 2016, Chicago, IL, USA, pp. 1443–1452.10.1109/IPDPSW.2016.68Search in Google Scholar

Roussel, O. (2011). Description of Ppfolio, https://www.cril.univ-artois.fr/~roussel/ppfolio/solver1.pdf.Search in Google Scholar

Silva, J.a.P.M. and Sakallah, K.A. (1996). GRASP—a new search algorithm for satisfiability, Proceedings of the 1996 IEEE/ACM International Conference on Computer-aided Design, ICCAD’96, San Jose, CA, USA, pp. 220–227.Search in Google Scholar

Vardi, M.Y. (2014). Moore’s law and the sand-heap paradox, Communications of the ACM57(5): 5–5.10.1145/2600347Search in Google Scholar

Xu, L., Hutter, F., Hoos, H.H. and Leyton-Brown, K. (2008). Satzilla: Portfolio-based algorithm selection for SAT, Journal of Artificial Intelligence Research32: 565–606.10.1613/jair.2490Search in Google Scholar

Zhang, H., Bonacina, M.P. and Hsiang, J. (1996). PSATO: A distributed propositional prover and its application to quasigroup problems, Journal of Symbolic Computation21(4–6): 543–560.10.1006/jsco.1996.0030Search in Google Scholar