1. DesktopGrid Applications in Asia Eric Yen 17 Sep. 2010

2. 2 e-Infrastructure in Asia WLCG Tier-1  EGEE Asia Federation EUAsiaGrid EDGES Deploy 3G in summer 2009 VC and Asia@Home Asia@Home initiated in 2009 Specific applications with user community and clear objectives puzzle@Home Drug Discovery

3. e-Science Applications for Asia Should for the Masses instead of for the big science Resources have to invest on critical projects Not easy to have many large resource centers Ways to better utilize resources are required Hazard Mitigation is the top focus Drug discovery on pandemic diseases  Autodock-based Geological disasters such as earthquake, tsunami and volcano Hydro-meteorological hazard mitigation  weather simulation Have to fit into regional small and medium scale resource infrastructure first User does not care where the job will run, only performance (min waiting time and overhead) matters. Service Grid + Desktop Grid is a perfect match User interface with workflow into account could reduce the barrier to access Grid services 3

4. e-Science Collaborations in Asia 4 DisciplineApplicationsPartnersGoing DG HEPATLAS, CMS, ALICE, BELLE, CDF, GEANT4 TH, TW, CESNET, INFN X BioMedicalVirtual Screening for Drug Discovery – Avian Flu, Dengue Fever MY, TW, VN, CESNET, INFN X Pandemic disease analysisVN, FR BioinformaticsGrid enabling phylogenetic inference SG, TW, VN, CESNET, INFN SVM Parameter optimization for prediction of Caspases Genome search to identify T3SS effect X Autodock ligand-receptor docking X Complex diseases studies Earth ScienceDisaster Mitigation on EarthquakeID, MY, PH, TH, VN, TW, CESNET, INFN X Comp ChemistryChemical compound property analysisTH, TW, CESNET X Climate ChangeWeather simulation, sea level risingID, PH, TH, VN, TW Social Sci.Social SimulationTW, UK X

5. 5 Virtual Screening Service by AutoDock View the best conformation of a simulation One-click job submission Submit the docking job to the Grid with just one click Generate the histogram with a given energy threshold Visualize your job status SG + DG

6. 6 Dengue Fever Data Challenge in 2009 Total number of completed docking jobs 300,000 Estimated needed computing power 4,167 CPU*days Duration of the experiment 60 days Cumulative computing results 42.5 GB Total Computing Recourses in EUAsia VO 268 Cores Number of used Computing Elements 6 Collaborators: UPM, MIMOS, MY IAMI, VN; HAII, TH Cesnet, CZ; GRC, TW

7. Puzzle @ Home – Distributed Reasoning by Grid and Flexible Resource Arrangement at Computing Nodes 7

8. Overview of Sudoku Sudoku is a logic-based, combinatorial number-placement puzzle. The objective is to fill a 9×9 grid with digits so that each column, each row, and each of the nine 3×3 sub-grids that compose the grid contains all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which typically has a unique solution. (ref: http://en.wikipedia.org/wiki/Sudoku) http://en.wikipedia.org/wiki/Sudoku 8

9. Sudoku’s predecessors Sudoku is a subset of Latin square. A Latin square is an n × n table filled with n different symbols in such a way that each symbol occurs exactly once in each row and exactly once in each column. The origin of those grids dates back to Middle Ages The name “Latin square” originates from mathematician Leonhard Euler 9 1234 2341 3412 4123

10. How many solutions does Sudoku have? A completed Sudoku grid is an order 9 (9 X 9) Latin square with additional constraint (Each subgrid contains the digits 1 to 9) How many unique filled-in (solution) Sudoku grids can be constructed? There are 576 Latin squares of order 4 5,524,751,496,156,892,842,531,225,600 Latin squares of order 9 10

11. How many solutions does Sudoku have? Clearly, the number of Sudoku solutions is fewer than the number of order 9 Latin squares As Bertram Felgenhauer and Frazer Jarvis found, there are 6,670,903,752,021,072,936,960 solutions Without symmetries, Ed Russell and Frazer Jarvis found the number is 5,472,730,538 11

12. Maximum number of clues problem Clues – The given numbers of a Sudoku puzzle Each 80-clues puzzle has a unique solution, What is the maximum number of clues that do not guarantee a unique solution? And, if there is unique solutions, find them all 12

13. Maximum number of clues problem The answer is 77 For example, this 77-clues puzzle has two solutions 13

14. Minimum number of clues problem Although the maximum number of clues problem is easy to solve, the opposite is not. The minimum number of clues problem: What the smallest number of clues that a Sudoku puzzle* can have? 14

15. Minimum number of clues problem 17-clue puzzles have been found. However, it’s still unknown whether there exists a 16-clue puzzle. We need such a sudoku checker program 15 Checker (have n-clues puzzles?) Checker (have n-clues puzzles?) n n YES NO

16. Minimum number of clues problem To find 16-clues puzzles, we can use checker to examine all symmetrically distinct solutions of Sudoku 16 Checker (have n-clues puzzles?) Checker (have n-clues puzzles?) Checker (have n-clues puzzles?) Checker (have n-clues puzzles?) Checker (have n-clues puzzles?) Checker (have n-clues puzzles?) 16 ? ? ? S1 S2 S 5,472,730,538

17. Checker algorithm (brute force) 17 n n C(81, n) n-clues puzzles Solver Input solution S Uniquely determine S? YES Checker Without optimization, it takes several hundreds of thousands CPU years. Research group is developing an efficient Sudoku checker algorithm which speed up by a factor of 128 and reduces the solution time to 2417 CPU years.

18. Summary DG+SG is a good solution for Asia e-Science applications, but job migration between them should be transparent. MPI job is still an issue for DG If that’s possible to make DG jobs multi-core env. sensitive ? Puzzle@Home is about an environment for combined puzzle applications To speed up solution discovery of NP-complete problem like n-clue Sudoku problem To better utilize computing node resources 18