GridSAT: a system for solving satisfiability problems using a computational grid

Parallel Computing

Volumn 32, Issue 9, 2006, Pages 660-687

  Chrabakh, Wahid ^a   Wolski, Rich ^a  

^a University of California   (United States)

Author keywords

Computational grid; Distributed; Parallel; Satisfiability; Scheduling

Indexed keywords

DISTRIBUTED DATABASE SYSTEMS; LEARNING ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SCHEDULING;

AUTONOMOUS GRIDS; COMPUTATIONAL GRID; DISTRIBUTED IMPLEMENTATION; SATISFIABILITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33750344241     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2006.01.004     Document Type: Article

References (62)

1. L.C. Alessandro Armando, Abstraction-driven sat-based analysis of security protocols, in: Theory and Applications of Satisfiability Testing, Proceedings of the Sixth International Conference, SAT 2003, May 2003, pp. 257-271.
2. Allen G., Angulo D., Foster I., Lanfermann G., Liu C., Radke T., Seidel E., and Shalf J. The Cactus Worm: experiments with dynamic resource discovery and allocation in a Grid environment. The International Journal of High Performance Computing Applications 15 4 (2001) 345-358
3. C.W.B. Li, F. Somenzi, Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure, December 2003.
4. Berman F., Chien A., Cooper K., Dongarra J., Foster I., Dennis Gannon L.J., Kennedy K., Kesselman C., Reed D., Torczon L., and Wolski R. The GrADS project: software support for high-level grid application development. International Journal of High Performance Computing Applications 15 4 (2001). Available from:
5. A. Biere, Available from: .
6. BlueHorizon, Available from: .
7. J. Brevik, D. Nurmi, R. Wolski, Predicting bounds on queuing delay for batch-scheduled parallel machines, in: Proceedings of PPoPP 2006.
8. R. Bjar, F. Many, Solving the Round Robin Problem Using Propositional Logic. AAAI/IAAI, 2000.
9. W. Chrabakh, R. Wolski, GrADSAT: A Parallel SAT Solver for the Grid. Technical Report 2003-05, UCSB, March 2003.
10. W. Chrabakh, R. Wolski. GridSAT: A chaff-based Distributed SAT solver for the Grid, in: Proceedings of the Supercomputing Conference, Phoenix, AZ, November 2003.
11. Condor home page - .
12. S.A. Cook, The complexity of theorem-proving procedures, in: Proceedings of the Third Annual ACM Symposium on Theory of Computing, 1971.
13. K. Czajkowski, S. Fitzgerald, I. Foster, C. Kesselman, Grid information services for distributed resource sharing, in: Proceedings of the 10th IEEE Symposium on High Performance Distributed Computing, 2001.
14. Data Star. Available from: .
15. Davis M., Logeman G., and Loveland D. A machine program for theory proving. Communications of the ACM (1962)
16. A. Downey, Predicting queue times on space-sharing parallel computers, in: Proceedings of the 11th International Parallel Processing Symposium, April 1997.
17. Feitelson D.G., and Rudolph L. Parallel Job Scheduling: Issues and Approaches (1995), Springer-Verlag
18. S.L. Forman, A.M. Segre, Nagsat: A randomized, complete, parallel solver for 3-sat. SAT2002, 2002.
19. M.P.I. Forum, Mpi: A Message-passing interface Standard. Technical Report CS-94-230, University of Tennessee, Knoxville, 1994.
20. Foster I., and Kesselman C. The Grid: Blueprint for a New Computing Infrastructure (1998), Morgan Kaufmann Publishers, Inc.
21. Fox G., Berman F., and Hey A. Grid Computing: Making the Global Infrastructure a Reality (2003), Wiley and Sons
22. E. Goldberg, Y. Novikov, BerkMin: A Fast and Robust SAT-solver, in: Design, Automation, and Test in Europe (DATE '02), March 2002, pp. 142-149.
23. GrADS. Available from: .
24. E.A. Hirsch, A. Kojevnikov, UnitWalk: A new SAT solver that uses local search guided by unit clause elimination, in: PDMI preprint 9/2001, Steklov Institute of Mathematics at St.Petersburg, 2001.
25. C.K.I. Foster, S. Tuecke, The anatomy of the grid, 2001.
26. D. Jackson, M. Vaziri, Finding bugs with a constraint solver, in: International Symposium on Software Testing and Analysis, 2000.
27. B. Jurkowiak, C.M. Li, G. Utard, Parallelizing Satz Using Dynamic Workload Balancing, in: Proceedings of Workshop on Theory and Applications of Satisfiability Testing (SAT'2001), June 2001, pp. 205-211.
28. H. Kautz, B. Selman, Planning as satisfiability, in: Proceedings of the 10th European Conference on Artificial Intelligence, August 1992, pp. 359-379.
29. Kunz W., and Stoffel D. Reasoning in Boolean Networks: Logic Synthesis and Verification Using Techniques (1997), Kluwer Academic Publishers, Boston
30. T. Larrabee, Efficient generation of test patterns using boolean difference. pp. 795-802.
31. Larrabee T. Test pattern generation using boolean satisfiability. IEEE Transactions on Computer-Aided Design 11 1 (1992) 6-22
32. Li W.W., Byrnes R.W., Hayes J., Birnbaum A., Reyes V.M., Shahab A., Mosley C., Pekurovsky D., Quinn G.B., Shindyalov I.N., Casanova H., Ang L., Berman F., Arzberger P.W., Miller M.A., and Bourne P.E. The encyclopedia of life project: grid software and deployment. New Generation Computing 22 2 (2004) 127-136
33. MAYHEM home page - http://pompone.cs.ucsb.edu//+.
34. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik. Chaff: engineering an efficient SAT solver, in: Proceedings of the 38th Design Automation Conference (DAC2001), Las Vegas, June 2001.
35. G. Nam, F. Aloul, K. Sakallah, R. Rutenbar, A comparative study of two boolean formulations of FPGA detailed routing constraints, in: Proceedings of the International Symposium on Physical Design (ISPD), Sonoma Wine County, California, 2001, pp. 222-227.
36. J. Plank, M. Beck, W. Elwasif, IBP: The internet backplane protocol. Technical Report UT-CS-99-426, University of Tennessee, 1999.
37. Reda S., and Salem A. Combinational equivalence checking using boolean satisfiability and binary decision diagrams. Proceedings of the Conference on Design, automation and test in Europe (2001), IEEE Press 122-126
38. Russell M., Allen G., Daues G., Foster I., Seidel E., Novotny J., Shalf J., and von Laszewski G. The astrophysics simulation collaboratory: a science portal enabling community software development. Cluster Computing 5 3 (2002) 297-304
39. SAT 2002 benchmarks. Available from: .
40. SAT 2002 challenge benchmark. Available from: .
41. SAT 2002 Competition. Available form: .
42. SAT 2003 benchmarks. Available from: .
43. SAT 2003 challenge benchmark. Available form: .
44. SAT 2003 Competition. Available form: .
45. Schulz M.H., and Auth E. Improved deterministic test pattern generation with applications to redundancy identification. IEEE Transactions on Computer-Aided Design 8 7 (1989) 811-816
46. Silva J.M., and Sakallah K. Grasp - a new search algorithm for satisfiability. ICCAD (1996), IEEE Computer Society Press
47. J.P.M. Silva, Search Algorithms for Satisfiability Problems in Combinational Switching Circuits. Ph.D. Thesis, The University of Michigan, 1995.
48. C. Sinz, W. Blochinger, W. Kuchlin, PaSAT - parallel SAT - checking with Lemma Exchange: Implementation and applications, in: Proceedings of SAT2001, 2001, pp. 212-217.
49. M. Swany, R. Wolski, Building performance topologies for computational grids, in: Proceedings of Los Alamos Computer Science Institute (LACSI) Symposium, 2002, October 2002.
50. Tannenbaum T., and Litzkow M. The condor distributed processing system. Dr. Dobbs Journal February (1995)
51. TeraGrid. Available from: .
52. TeraGrid at Argonne National Laboratory. Available from: .
53. TeraGrid at Caltech Center for Advanced Computing Research. Available from: .
54. TeraGrid at Pittsburgh Supercomuting Center. Available from: .
55. TeraGrid at the National Center for Scientific Applications. Available from: .
56. TeraGrid at the San Diego Supercomputing Center. Available from: .
57. VGrADS. Available from: .
58. R. Wolski, J. Brevik, C. Krintz, G. Obertelli, N. Spring, A. Su, Running EveryWare on the computational grid, in: SC99 Conference on high-performance Computing Proceedings, 1999.
59. Wolski R., Brevik J., Obertelli G., Spring N., and Su A. Writing programs that run everyware on the computational grid. IEEE Transactions on Parallel and Distributed Systems 12 10 (2001). Available from:
60. Wolski R., Spring N., and Hayes J. The network weather service: a distributed resource performance forecasting service for metacomputing. Future Generation Computer Systems 15 5-6 (1999) 757-768
61. R. Wolski, N. Spring, J. Hayes, Predicting the cpu availability of time-shared unix systems on the computational grid, in: Proceedings of the Eighth IEEE Symposium on High Performance Distributed Computing, 1999.
62. L. Zhang, C.F. Madigan, M.W. Moskewicz, S. Malik, Efficient conflict driven learning in boolean satisfiability solver, in: ICCAD, 2001, pp. 279-285,.