The GridSAT portal: A Grid Web-based portal for solving satisfiability problems using the national cyberinfrastructure

Concurrency and Computation: Practice and Experience

Volumn 19, Issue 6, 2007, Pages 795-808

  Chrabakh, Wahid ^a   Wolski, Rich ^a  

^a University of California   (United States)

Author keywords

Computational Grid; Distributed; Parallel; Portal; Satisfiability solver; Web

Indexed keywords

BOOLEAN ALGEBRA; PARALLEL PROCESSING SYSTEMS; PORTALS; PROBLEM SOLVING; RESOURCE ALLOCATION; WEB SERVICES;

COMPUTATIONAL GRIDS; LARGE-SCALE NATIONAL COMPUTING CENTERS; SATISFIABILITY SOLVER;

GRID COMPUTING;

EID: 34247874489     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1079     Document Type: Article

References (46)

1. 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. The International Journal of High Performance Computing Applications 2001; 15(4):345-358.
2. Lattice Portal. http://lqcd.jlab.org [May 2005].
3. GrADS. http://hipersoft.cs.rice.edu/grads [May 2005].
4. VGrADS. http://hipersoft.cs.rice.edu/vgrads [May 2005].
5. Mandal A, Kennedy K, Koelbel C, Marin G, Liu B, Johnsson L, Mellor Crummey J. Scheduling strategies for mapping application workflows onto the Grid. Proceedings of the 14th IEEE Symposium on High Performance Distributed Computing (HPDC 2005), 2005. IEEE Computer Society Press: Los Alamitos, CA, 2005; 59-68.
6. NRC Grid Portal, http://www.grid.nrc.ca [May 2005].
7. GEON Portal. http://www.geongrid.org [May 2005].
8. Theoretical Physics Portal, http://www.aus-vo.org [May 2005].
9. Gene Grid Portal, http://www.qub.ac.uk/escience/projects/genegrid/ [May 2005].
10. Cook SA. The complexity of theorem-proving procedures. Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971. ACM Press: New York, 1971; 151-158.
11. Bjar R, Many F. Solving the round robin problem using prepositional logic. Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, Austin, TX, 30 July-3 August 2000. AAAI Press/MIT Press: Menlo Park, CA/Cambridge, MA, 2000.
12. 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 2005; 7(2):143-155. DOI: 10.1007/s10009-004-0169-2.
13. Alessandro Armando LC. Abstraction-driven SAT-based analysis of security protocols. Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), May 2003. Springer: Berlin, 2003; 257-271.
14. Kautz H, Selman B. Planning as satisfiability. Proceedings of the 10th European Conference on Artificial Intelligence, August 1992. Wiley: New York, 1992; 359-363.
15. Jackson D, Vaziri M. Finding bugs with a constraint solver. Proceedings of the International Symposium on Software Testing and Analysis, 2000. ACM Press: New York, 2000; 14-25.
16. Silva JPM. Search algorithms for satisfiability problems in combinational switching circuits. PhD Thesis. University of Michigan, 1995.
17. Nam G, Aloul F, Sakallah K, Rutenbar R. A comparative study of two boolean formulations of FPGA detailed routing constraints. Proceedings of the International Symposium on Physical Design. Sonoma Wine County. CA, 2001. ACM Press: New York, 2001; 222-227.
18. Kunz W, Stoffel D. Reasoning in Boolean Networks: Logic Synthesis and Verification Using Techniques. Kluwer Academic: Boston, MA, 1997.
19. Reda S, Salem A. Combinational equivalence checking using Boolean satisfiability and binary decision diagrams. Proceedings of the Conference on Design, Automation and Test in Europe. IEEE Press: Piscataway, NJ, 2001; 122-126.
20. Larrabee T. Test pattern generation using Boolean satisfiability. IEEE Transactions on Computer-Aided Design 1992; 4-15.
21. Minato SI. Binary Decision Diagrams and Applications for VLSI CAD. Kluwer Academic: Boston, MA, 1995.
22. Silva JPM, Sakallah K. GRASP - a new search algorithm for satisfiability. Proceedings of the International Conference on Computer-Aided Design. IEEE Computer Society Press: Los Alamitos, CA, 1996.
23. Moskewicz M, Madigan C, Zhao Y, Zhang L, Malik S. Chaff: Engineering an efficient SAT solver. Proceedings of the 38th Design Automation Conference (DAC 2001), Las Vegas, NV. June 2001. ACM Press: New York. 2001: 530-535.
24. Goldberg E, Novikov Y. BerkMin: A fast and robust SAT-solver. Proceedings of Design. Automation, and Test in Europe (DATE'02), March 2002. IEEE Computer Society Press: Los Alamitos, CA, 2002: 142-149.
25. Li CM. A constrained-based approach to narrow search trees for satisfiability. Information Processing Letters 1999; 71:75-80.
26. SAT Competition Web Site. http://www.satlive.org/SATCompetition/ [May 2005].
27. SAT Live Web Site, http://www.satlive.org/ [May 2005].
28. Sinz C, Blochinger W, Kuchlin W. PaSAT-Parallel SAT-checking with lemma exchange: Implementation and applications. Proceedings of the Workshop on Theory and Applications of Satisfiability Testing (SAT'2001). June 2001. Elsevier: Amsterdam, 2001; 212-217.
29. Jurkowiak B, Li CM, Utard G. Parallelizing Satz using dynamic workload balancing. Proceedings of the Workshop on Theory and Applications of Satisfiability Testing (SAT'2001), June 2001. Elsevier: Amsterdam, 2001; 205-211.
30. Forman SL, Segre AM. NAGSAT: A randomized, complete, parallel solver for 3-SAT. Proceedings of the Workshop on Theory and Applications of Satisfiability Testing (SAT'2002), 2002.
31. Chrabakh W, Wolski R. GridSAT: A chaff-based distributed SAT solver for the Grid. Proceedings of the Supercomputing Conference, November 2003. ACM Press: New York, 2003.
32. Czajkowski K. Fitzgerald S, Foster I. Kesselman C. Grid information services for distributed resource sharing. Proceedings of the 10th IEEE Symposium on High Performance Distributed Computing, 2001. IEEE Press: Piscataway, NJ, 2001.
33. Wolski R. Spring N, Hayes J. The network weather service: A distributed resource performance forecasting service for metacomputing. Future Generation Computer Systems 1999; 15(5-6):757-768.
34. Swany M, Wolski R. Building performance topologies for computational Grids. Proceedings of the Los Alamos Computer Science Institute (LACSI) Symposium, October 2002.
35. Wolski R, Spring N, Hayes J. Predicting the CPU availability of time-shared Unix systems on the computational Grid. Proceedings of the 8th IEEE Symposium on High Performance Distributed Computing, 1999. IEEE Computer Society Press: Los Alamitos, CA, 1999.
36. NPACI HotPage. https://hotpage.npaci.edu/ [May 2005].
37. Novotny J. The Grid portal development kit. Concurrency and Computation: Practice and Experience 2002; 14(13-15): 1129-1144.
38. Grid Sphere Web Site, http://www.gridsphere.org [May 2005].
39. Apache Software Foundation. Jetspeed. http://portals.apache.org/jetspeed- 1 [May 2005].
40. Suzumura T, Nakada H, Matsuoka S, Casanova H. Godspeed: A Web-based Grid portal generation server. Proceedings of the 7th International Conference on High Performance Computing and Grid in Asia Pacific Region (HPCAsia), July 2004. IEEE Computer Society Press: Los Alamitos, CA, 2004; 26-33.
41. Apache Software Foundation. Apache Web server, http://www.apache.org [May 2005].
42. PHP Web Site, http://www.php.net [May 2005].
43. MySQL Web Site. http://www.mysql.com [May 2005].
44. TeraGrid Web Site. http://www.teragrid.org/ [May 2005].
45. Data Star Web Site. http://www.npaci.edu/DataStar [May 2005].
46. LoneStar Home Page. http://www.tacc.utexas.edu/services/userguides/ lonestar [May 2005].