The GridSAT portal: a Grid Web‐based portal for solving satisfiability problems using the national cyberinfrastructure

We present a Grid portal problem (which is accessible through http://orca.cs.ucsb.edu/sat_portal) for solving Boolean satisfiability. The portal provides a simple and public interface to a sophisticated and complex Grid application—GridSAT—running on a large set of distributed computational resources hosted in different large-scale national computing centers (i.e. the national cyberinfrastructure circa 2005). In this paper we describe the design goals of the portal and how it has influenced some of the application features. We also describe how the adaptive and self-tuning features of Grid applications (written from first principles) make the portal simpler and easier to implement. Copyright © 2006 John Wiley & Sons, Ltd.

[1]  Alessandro Armando,et al.  Abstraction-Driven SAT-based Analysis of Security Protocols , 2003, SAT.

[2]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[3]  Daniel Jackson,et al.  Finding bugs with a constraint solver , 2000, ISSTA '00.

[4]  Ramón Béjar,et al.  Solving the Round Robin Problem Using Propositional Logic , 2000, AAAI/IAAI.

[5]  R. Wolski,et al.  GridSAT: A Chaff-based Distributed SAT Solver for the Grid , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[6]  Gil Utard,et al.  Parallelizing Satz Using Dynamic Workload Balancing , 2001, Electron. Notes Discret. Math..

[7]  Sherief Reda,et al.  Combinational equivalence checking using Boolean satisfiability and binary decision diagrams , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.

[8]  Chu Min Li,et al.  A Constraint-Based Approach to Narrow Search Trees for Satisfiability , 1999, Inf. Process. Lett..

[9]  Chao Wang,et al.  Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure , 2005, International Journal on Software Tools for Technology Transfer.

[10]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[11]  Richard Wolski,et al.  Building Performance Topologies for Computational Grids , 2004, Int. J. High Perform. Comput. Appl..

[12]  Rob A. Rutenbar,et al.  A comparative study of two Boolean formulations of FPGA detailed routing constraints , 2001, ISPD '01.

[13]  Karem A. Sakallah,et al.  GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.

[14]  Jason Novotny,et al.  The Grid Portal Development Kit , 2002, Concurr. Comput. Pract. Exp..

[15]  Wolfgang Küchlin,et al.  PaSAT - Parallel SAT-Checking with Lemma Exchange: Implementation and Applications , 2001, Electron. Notes Discret. Math..

[16]  John Shalf,et al.  The Cactus Worm: Experiments with Dynamic Resource Discovery and Allocation in a Grid Environment , 2001, Int. J. High Perform. Comput. Appl..

[17]  Ken Kennedy,et al.  Scheduling strategies for mapping application workflows onto the grid , 2005, HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005..

[18]  Dominik Stoffel,et al.  Reasoning in Boolean Networks - Logic Synthesis and Verification Using Testing Techniques , 1997, Frontiers in electronic testing.

[19]  Ian T. Foster,et al.  Grid information services for distributed resource sharing , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[20]  H. Casanova,et al.  GridSpeed: a Web-based grid portal generation server , 2004, Proceedings. Seventh International Conference on High Performance Computing and Grid in Asia Pacific Region, 2004..

[21]  João Silva.  Search algorithms for satisfiability problems in combinational switching circuits , 1996 .

[22]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[23]  Tracy Larrabee,et al.  Test pattern generation using Boolean satisfiability , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[24]  Richard Wolski,et al.  The network weather service: a distributed resource performance forecasting service for metacomputing , 1999, Future Gener. Comput. Syst..

[25]  S. Minato.  Binary Decision Diagrams and Applications for VLSI CAD , 1995 .

[26]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002 .

[27]  R. Wolski,et al.  Predicting the CPU availability of time‐shared Unix systems on the computational grid , 1999, Proceedings. The Eighth International Symposium on High Performance Distributed Computing (Cat. No.99TH8469).