1. GridSAT Portal: A Grid Portal for Solving Satisfiability Problems Wahid Chrabakh and Rich Wolski University of California, Santa Barbara

2. Challenging Scientific Problems u Computationally demanding – Large compute power – Extended Periods of time u Infrastructure: – Desktops, Clusters, Supercomputers u Common Resource Usage: – Most suitable for co-located nodes – Determine number of nodes to use – Use all nodes until termination criteria reached

3. Satisfiability u Example of dynamic resource use u Application Characteristics: – Branch-and-bound – Unpredictable runtime behavior – Memory Intensive: Internal database grows overwhelming RAM – CPU intensive: 100% CPU load

4. Satisfiability Problem(SAT) u Set of variables V={v i | i=1,…,k} u Literal: a variable or its complement u Problems in CNF form: community standard u Clause: OR of a set of literals u Conjunctive Normal Form: F=C 1 C 2 C 3 … C k u Standard File format: p cnf num_vars num_clauses c comments +v1 –v2 … +v213 0

5. Satisfiability Applications u Circuit Design u FPGA routing u Model Checking: – AI, software u Security u Scheduling u Theoretical: – physics, chemistry, combinatorics u Many More…

6. SAT Community u Communities: – SATLive: http://www.satlive.org/http://www.satlive.org/ News, forums, links, documents – SATEx: http://www.lri.fr/~simon/satexhttp://www.lri.fr/~simon/satex Experimentation and execution system – SATLIB: http://www.satlib.org/http://www.satlib.org/ Dynamic set of Benchmarks Freely available solvers

7. Who uses SAT Live! u Period: Sep 2000- Jan 2003 – 21,766 distinct hosts u Jan 7-13 2003: 524 distinct hosts u SATLIB: 250 hits/month

8. SAT Competition u http://www.satcompetition.org/ http://www.satcompetition.org/ u 55 Sequential Solvers: circus, circush0, cls, compsat, eqube2, forklift, funex, gasat, isat1, tts-2-0, unitwalk, walksatauto, walksatmp, walksatskc, werewolf, wllsatv1, zchaff, zchaff_rand circuscircush0clscompsateqube2 forkliftfunexgasatisat1tts-2-0unitwalkwalksatautowalksatmp walksatskcwerewolfwllsatv1zchaffzchaff_rand u Execution uses SAT-Ex u Two rounds: – First round: easy problems – Second round: harder problems u Awards to category leaders for SAT, UNSAT and overall u Challenging set: some problems left unsolved

9. Benchmarks: u Community submitted benchmarks u Crafted Benchmark: (38 MB) – Especially made to give a hard time to the solver u Random Benchmark: (11 MB) u Industrial Benchmark: (2 GB) – REAL industrial instances from all domains

10. GridSAT: The Solver u Parallel distributed SAT solver based on GridSAT u Based on zChaff leading sequential Solver u GridSAT beats zChaff on problems that zChaff can solve u GridSAT Solves problems which were not previously solved

11. GridSAT: Grid Aware u Highly Portable Components u Uses resources simultaneously: – Single nodes, Clusters, SuperComputers – Resources may leave and join at any time u Fault-tolerant: – Error detection & checkpointing – All resources can/do fail: – Even reliable resources: Maintenance & upgrade periods u Reactive to Resource Composition and Load: Migration

12. How to make GridSAT available to users? u Deploy GridSAT locally by interested users – Complex – Not enough computational resources u Feedback from SAT experts: – Make it available through a portal – Simple interface: minimal user input u GridSAT Portal: orca.cs.ucsb.edu/sat_portalorca.cs.ucsb.edu/sat_portal u Test problems: orca.cs.ucsb.edu/sat_portal/test_problems.htm orca.cs.ucsb.edu/sat_portal/test_problems.htm

13. Internal Design WebServer User DataStarTeraGridDesktop Machines GridSAT Coordinator

14. User accounts:

15. Problem Submission

16. List Problems

17. Detailed Report

18. Budget based Scheduling u CPU count or timeout may not be fulfilled – CPU count: too large – Time limit: too large or too small u Find closest job to user request u May need multiple jobs u Use Max CPUs * Timeout as a budget: – Debit from budget for every job

19. Conclusion u New science and engineering portal u GridSAT: Grid enabled application manages resources u Web Portal: – Launch coordinators – Provide feedback and Accounting u Challenge: – Provide compelling service to get community interested

20. Thanks u LRAC Allocation through NSF u TeraGrid: – SDSC, NCSA, PSC, TACC u DataStar at SDSC: also BlueHorizon u Mayhem Lab at UCSB

21. User Environment u Input: – Problem in standard CNF format – Max number of CPUs to use – Timeout period u Feedback: – Jobs: resource, status, submit, start and end times – Total number of active processors – CPU*hours consumed – Number of checkpoints – Final result: UNSAT or SAT instance

22. Programming Models u Synchronous Model: – Predictable Space: number of nodes, memory – Predictable Time: How long per instance – Synchronization Barrier – Fits Cluster Model (MPI) u Asynchronous Model: – Dynamic resource requirement, – Variable and Unpredictable duration – Asynchronous Events – Fits Computational Grid environment

23. Thanks u LRAC Allocation through NSF u TeraGrid: – SDSC, NCSA, PSC, TACC u DataStar at SDSC: also BlueHorizon u Mayhem Lab at UCSB