Abstract
We present the latest instantiation of GridSAT [1], a distributed and complete satisfiability solver that is explicitly designed to aggregate Grid resources for application performance. GridSAT was previously shown to outperform the state-of-the-art sequential solvers. In this work, we explore the unprecedented solving power GridSAT enables through algorithmic and implementation innovations. We describe the implementation techniques that allow GridSAT to leverage a variety of high-end batch-scheduled resources, clusters, interactive workstations, and personal computing resources through autonomous scheduling, checkpoint scheduling, and work migration. These innovations have allowed GridSAT to solve a set of ‘hard’ and previously unsolved industrial and community satisfiability problems. In addition to this new solution power, GridSAT also outperforms the otherwise highest performance general solvers on the annual SAT competition [21] performance benchmarks.
Similar content being viewed by others
References
Chrabakh, W., Wolski, R.: GridSAT: A chaff-based Distributed SAT solver for the Grid. Supercomputing Conference, Phoenix, Arizona, November 2003. http://www.cs.ucsb.edu/ chrabakh/papers/gridsat.pdf
Chrabakh, W., Wolski, R.: GridSAT Portal: A GridWeb-based Portal for Solving Satisfiability Problems Using National Cyberinfrastrcture. Journal of Concurrency and Computation: Practice and Experience. John Wiley & Sons, New York [to appear]
den Burger, M., Kielmann, T., Bal, H.E.: Balanced Multicasting: High-throughput Communication for Grid Applications. Proceedings of the ACM/IEEE SC2005 Conference on High Performance Networking and Computing (2005)
Allen, G., Davis, K., Dolkas, K.N., Doulamis, N.D., Goodale, T., Kielmann, T., Merzky, A., Nabrzyski, J., Pukacki, J., Radke, T., Russell, M., Seidel, E., Shalf, J., Taylor, I.: Enabling Applications on the Grid: A GridLab Overview. International Journal of High Performance Computing Applications: Special issue on Grid Computing: Infrastructure and Applications, August 2003
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. 38th Design Automation Conference (DAC2001), Las Vegas, June 2001
Foster, I., Kesselman, C. (eds.): The Grid – Blueprint for a New Computing Infrastructure. Morgan Kaufmann (1998)
Berman, F., Fox, G., Hey, T. (eds.): Grid Computing: Making the Global Infrastructure a Reality. Wiley, New York (2002)
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., Bourne, P.E.: The encyclopedia of life project: Grid software and deployment. New Gener. Comput. 22-2, 127–136 (2004)
Allen, G., Angulo, D., Foster, I., Lanfermann, G., Liu, C., Radke, T., Seidel E., Shalf, J.: The cactus worm: Experiments with dynamic resource discovery and allocation in a Grid environment. Int. J. High Perform. Comput. Appl. 15-4, 345–358 (2001)
Silva, J.P.M.: Search Algorithms for Satisfiability Problems in Combinational Switching Circuits. PhD thesis, University of Michigan (1995)
Nam, G., Aloul, F., Sakallah, K., Rutenbar, R.: A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints. International Symposium on Physical Design (ISPD), Sonoma Wine County, California, pp. 222–227 (2001)
Kunz, W., Stoffel, D.: Reasoning in Boolean Networks: Logic Synthesis and Verification Using Techniques. Kluwer, Boston (1997)
Larrabee, T.: Test Pattern Generation Using Boolean Satisfiability. IEEE Transactions on Computer-Aided Design. pp. 4–15, January 1992
Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT-solver. Design, Automation, and Test in Europe (DATE '02). pp. 142–149, March 2002
Hirsch, E.A., Kojevnikov, A.: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. PDMI preprint 9/2001, Steklov Institute of Mathematics at St.Petersburg (2001)
Biere, A.: Limmat. http://www.inf.ethz.ch/personal/biere/projects/limmat/
Silva, J.P.M., Sakallah, K.: Grasp - a new search algorithm for satisfiability. ICCAD. IEEE Computer Society (1996)
Sinz, C., Blochinger, W., Kuchlin, W.: PaSAT - Parallel SAT-Checking with Lemma Exchange: Implementation and Applications. Proceedings of SAT2001, pp. 212–217 (2001)
Forman, S.L., Segre, A.M.: NAGSAT: A Randomized, Complete, Parallel Solver for 3-SAT. Proceedings of SAT2002 (2002)
Jurkowiak, B., Li, C.M., Utard, G.: Parallelizing Satz Using Dynamic Workload Balancing. Proceedings of Workshop on Theory and Applications of Satisfiability Testing (SAT'2001), pp. 205–211, Boston, June 2001
SAT Competition: http://www.satlive.org/SATCompetition/ http : // www. satlive. org / SAT- Competition/
Blochinger, W., Westje, W., Küchlin, W., Wedeniwski, S.: ZetaSAT–Boolean SATisfiability Solving on Desktop Grids. Proc. of the IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2005) (2005)
Wrzesinska, G., Maassen, J., Verstoep, K., Bal, H.E.: Satin++: Divide-and-Share on the Grid. Submitted for publication, 2005
Chrabakh, W., Wolski, R.: GrADSAT: A Parallel SAT Solver for the Grid. UCSB Technical Report, 2003-05, March 2003
Foster, I., Kesselman, C.: Globus: A Metacomputing Infrastructure Toolkit. IJSA (1997)
Message Passing Interface Forum: MPI: A message-passing interface standard. University of Tennessee, Knoxville, CS-94-230 (1994)
OASIS Web Services Reosurce Framework (WSRF) TC:http://www.oasis-open.org/committees/tc_home.php?wg_abbrev=wsrf
The W3C Web Services Architecture working group, public draft, August 2003. http://www.w3.org/TR/2003/WD-ws-arch-20030808/
Tuecke, S., Liu, L., Meder, S.: http://docs.oasis-open.org/wsrf/2005/03/wsrf-WS-BaseFaults-1.2-draft-04.pdf
Graham, S., Murray, B.: http://docs.oasis-open.org/wsn/2004/06/wsn-WS-BaseNotification-1.2-draft-03.pdf http://docs.oasis-open.org/ wsn / 2004 / 06 / wsn - WS - BaseNotification - 1.2 - draft - 03. pdf
Davis, M., Logeman, G., Loveland, D.: A machine program for theory proving. Commun. ACM 5, 394–397 (1962)
Schulz, M.H., Auth, E.: Improved deterministic test pattern generation with applications to redundancy identification. IEEE Trans. Comput.−Aided Des. 8(7), 811–816 (July 1989)
Larrabee, T.: Efficient Generation of Test Patterns Using Boolean Difference, pp. 795–802 (1990)
Czajkowski, K., Fitzgerald, S., Foster, I., Kesselman, C.: Grid Information Services for Distributed Resource Sharing. HPDC10 (2001)
Wolski, R.: Experiences with predicting resource performance on-line in computational Grid settings. ACM SIGMETRICS Performance Evaluation Review. 30(4), 41–49 (2003)
Wolski, R., Spring, N., Hayes, J.: The Network Weather Service: A Distributed Resource Performance Forecasting Service for Metacomputing. Future Generation Computer Systems (1999)
Jackson, D., Vaziri, M.: Finding Bugs with a Constraint Solver. International Symposium on Software Testing and Analysis (2000)
Wolski, R.: Brevik, J., Krintz, C., Obertelli, G., Spring, N., Su, A.: Running EveryWare on the Computational Grid. SC99 Conference on High-performance Computing Proceedings (1999)
Wolski, R., Brevik, J., Obertelli, G., Spring, N. Su, A.: Writing programs that run EveryWare on the computational Grid. IEEE Trans. Parallel Distrib. Syst. 12(10), (2001). available from http://www.cs.ucsb.edu/rich/publications/ev-results.ps.gz
Berman, F., Chien, A., Cooper, K., Dongarra, J., Foster, I., Gannon, D., Johnsson, L., Kennedy, K., Kesselman, C., Reed, D., Torczon, L., Wolski, R.: The GrADS project: Software support for high-level Grid application development. Int. J. High Perform. Comput. Appl. 15(4), (2001) http://hipersoft.cs.rice.edu/grads/publications_reports.htm
Bjar, R., Many, F.: Solving the Round Robin Problem Using Propositional Logic. AAAI/IAAI, pp. 262–266 (2000)
Li, B., Wang, C., Somenzi, F.: Abstraction Refinement in Symbolic Model Checking Using Satisfiability as the Only Decision Procedure. International Journal on Software Tools for Technology Transfer (STTT), December 2003
Armando, A., Compagna, L.: Abstraction-Driven SAT-based Analysis of Security Protocols. Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003, pp. 257–271 (2003)
Kautz, H., Selman, B.: Planning as satisfiability. Proceedings of the Tenth European Conference on Artificial Intelligence, pp. 359–379, August 1992
The TeraGrid Home Page: http://www.teragrid.org
Tannenbaum, T., Litzkow, M.: The Condor Distributed Processing System. Dr. Dobbs Journal, February 1995
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by grants from the National Science Foundation, numbered CAREER-0093166, EIA-9975020, ACI-0103759, and CCR-0331654 and by the San Diego Supercomputer Center and the TeraGrid project.
Rights and permissions
About this article
Cite this article
Chrabakh, W., Wolski, R. GridSAT: Design and Implementation of a Computational Grid Application. J Grid Computing 4, 177–193 (2006). https://doi.org/10.1007/s10723-006-9042-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10723-006-9042-8