1. 2003/10/3 UK Jpana N+N Meeting 1 “Grid Platform for Drug Discovery” Project Mitsuhisa Sato Center for Computational Physics, University of Tsukuba, Japan

2. 2003/10/3 UK Jpana N+N Meeting 2 Our Grid Project JST-ACT program: “Grid platform for drug discovery”, funded by JST(Japan Science and Technology Corporation), 1.3 M$/ 3 years started from 2001 –Tokushima University, Toyohashi Inst. Of Tech., University of Tsukuba, Fuji Res. Inst. Corp. ILDG: International Lattice QCD Data Grid –CCP, U. of Tsukuba, EPCC UK, SciDAC US. –Design of QCDML –QCD Meta database by web services, QCD data sharing by SRM and Globus replica …

3. 2003/10/3 UK Jpana N+N Meeting 3 High Throughput Computing for drug discovery Exhaustive parallel conformation search and docking over Grid Accumulation computing results into large scale database and reuse High performance ab initio MO calculation for large molecules on clusters “Combinatorial Computing” Using Grid

4. 2003/10/3 UK Jpana N+N Meeting 4 Grid applications of our drug-discovery Conformation search : find possible confirmations Docking search: compute energy of combination of molecules Quantitative Structure-Activity Relationships (SQAR) analysis: finding rules of drug design Conformation Search Drug libraries Docking Search (using ab initio MO calculation) Conform- ations Docking Computation results QSAR analysis target CONFLEX-G Grid enabled Conformation Search application MO in clusters Job submission for MO Coarse-grain MO for Grid (REMD, FMO) Design of XML for results Web service interface

5. 2003/10/3 UK Jpana N+N Meeting 5 Stepwise Rotation Corner Flap Edge Flip CONFLEX Algorithm: tree searchAlgorithm: tree search –Local conformation changes –Initial conformation selection We are implementing with OmniRPCWe are implementing with OmniRPC – Tree search action is dynamic!!! Conformation search tree Anti  E=0.0 kcal/mol Gauche +  E=0.9 kcal/mol Gauche -  E=0.9 kcal/mol

6. 2003/10/3 UK Jpana N+N Meeting 6 Gird Platform for drug discovery Univ. of Tsukuba AIST Toyohashi Inst. Of Tech. Tokushima Univ. Control & monitoring Scheduling and monitoring of computations distributed data base management Design of Ｇ rid middleware Development of large-scale ab-initio MO program Cluster for CONFLEX development of conformation search program (CONFLEX) Database for CONFLEX results Database of MO calculation results 3D structure database for drug design wide-area network wide-area network request

7. 2003/10/3 UK Jpana N+N Meeting 7 What can Grid do? Parallel Applications, programming, and our view for grid “Typical” Grid Applications –Parametric execution: Execute the same program with different parameters using an large amount of computing resources –master-workers type of parallel program “Typical” Grid Resources –A Cluster of Clusters: some PC Clusters are available –Dynamic resources: load and status are changed time-to-time. ＰＣ PC Cluster ＰＣ PC Cluster Our View ＰＣ PC Cluster GridEnvironmentGridEnvironment

8. 2003/10/3 UK Jpana N+N Meeting 8 Parallel programming in Grid –Using Globus shell (GSH) Submit batch job scripts to remote nodes staging and workflow –Grid MPI (MPICH-G, PACX MPI, …) General-purpose, but difficult and error-prone No support for dynamic resource and fault-tolerance No support for Firewall, clusters with private network. –Grid RPC a good and intuitive programming interface Ninf, NetSolve, … OmniRPC

9. 2003/10/3 UK Jpana N+N Meeting 9 Overview of OmniRPC A Grid RPC system for parallel computing Provide seamless parallel programming environment from clusters to grid. –It use “rsh” for a cluster, “GRAM” for a grid managed by Globus, “ssh” for a conventional remote nodes. –Program development and testing in PC clusters –Product run in Grid to exploit huge computing resources –User can switch configuration with “host file” without any modification Make use of remote clusters of PC/SMP as Grid computing resource –Support for clusters in firewall and private address PC PC Cluster PC PC PC PC PC PC PC PC PC PC PC PC PC PC PC Client Grid Environment <Agent invoker=“globus” mxio=“on”/> <JobScheduler type=“rr” maxjob=“20”/> Host file

10. 2003/10/3 UK Jpana N+N Meeting 10 Overview of OmniRPC (cont.) Easy-to-use parallel programming interface –A gridRPC based on Ninf Grid RPC –Parallel programming using asynchronous call API –The thread-safe RPC design allows to use OpenMP in client programs Support Master-workers parallel programs for parametric search grid applications –Persistent data support in remote workers for applications which requires large data Monitor and performance tools int main(int argc, char **argv) { int i, A[100][100],B[100][100][100],C[100][100][100]; OmniRpcRequest reqs[100]; OmniRpcInit(&argc, &argv); for(i = 0; i< 100; i++) reqs[i] = OmniRpcCallAsync(“mul”,100, B[i], A, C[i]); OmniRpcWaitAll(100,reqs);. OmniRpcFinalize(); return 0; }

11. 2003/10/3 UK Jpana N+N Meeting 11 OmniRPC features need Globus? –No, you can use “ssh” as well as “globus” –It is very useful for an application people. –“ssh” can solve “firewall” problem. Data persistence model? –Parameter search type application need to share the initial data. –OmniRPC support it. Can use many (remote) clusters? –Yes, OmniRPC supports “cluster of clusters”. How to use in different machine and environment ? –You can switch the configuration by “config file” without modification on source program. Why not “Grid PRC” standard? –OmniRPC provides high level interface, to avoid “scheduling” and “fault- tolerance” from users.

12. 2003/10/3 UK Jpana N+N Meeting 12 OmniRPC Home Page http://www.omni.hpcc.jp/omnirpc/

13. 2003/10/3 UK Jpana N+N Meeting 13 Conflex from Cluster to Grid For large bimolecules, the number of combinational trial structure will be huge! Geometry optimization of large molecular structures requires more time to compute! Geometry optimization phase takes more than 90% in total execution time So far, executed on PC Cluster by using MPI Grid allows to use huge computing resources to overcome these problem!

14. 2003/10/3 UK Jpana N+N Meeting 14 Our Grid Platform Univ. of Tsukuba Dennis Cluster Dual P4 Xeon 2.4GHz 10 nodes Alice Cluster Dual Athlon 1800+ 14 nodes AIST UME Cluster Dual P3 1.4GHz 32 nodes Tokushima Univ. Toku Cluster P3 1.0GHz 8 nodes Toyohashi Univ. of Tech. Toyo Cluster Dual Athlon 2000+ 8 nodes Tsukuba WAN SINET

15. 2003/10/3 UK Jpana N+N Meeting 15 Summary of Our Grid Environment Dual P3 1.4GHz P3 1GHz Dual Athlon 1800+ Dual P4 Xeon 2.4GHz Machine overview 32 8 8 14 10 # of Nodes --Dennis 0.6924.40Toku 2.122.73UME 0.5513.00Toyo 11.220.18Alice Throughput (MB/s)# RTT ＊ （ ms)# Cluster ＊ Round-Trip Time # All measurement Dennis Cluster and Each Cluster

16. 2003/10/3 UK Jpana N+N Meeting 16 CONFLEX-G:Grid enabled CONFLEX Parallelize molecular geometry optimization phase using Master/Worker model. OmniRPC persistent data model (automatic initializable remote module facility) allows to reuse workers for each call. –Eliminate initializing worker program at every PRC. Selection of Initial Structure Local Perturbation Geometry Optimization Comparison & Store Conformation Database PC PC Cluster A PC PC Cluster B PC PC Cluster C PC

17. 2003/10/3 UK Jpana N+N Meeting 17 Experiment Setting CONFLEX ’ s version: 402q Test data: Two Molecular samples –C17 (51 atoms) –AlaX16a (181 atoms). Authentication method :SSH CONFLEX-G client program was executed on the server node of Dennis cluster We used all nodes in clusters of our grid

18. 2003/10/3 UK Jpana N+N Meeting 18 Sample Molecules 320 522 # of opt. trial structures 96000 = 26.7(h) 300160 AlaX16a (181 atoms) 8351.648 C17 (51 atoms) Estimated total exec.time for all Trial structures in Dennis’s Single CPU (s) Average exec. time to opt. trial structure (s) # of trial structure at one opt. phase (degree of parallelism) data

19. 2003/10/3 UK Jpana N+N Meeting 19 Comparison between OmniRPC and MPI in Dennis Cluster C17 （ 51 atoms, degree of parallelism 48 ） Overhead of On-Demand Initialization of worker program in OmniRPC 10 times Speedup using OmniRPC

20. 2003/10/3 UK Jpana N+N Meeting 20 Execution time of AlaX16a (181 atoms, degree of parallelism 160) 64 times Speedup

21. 2003/10/3 UK Jpana N+N Meeting 21 Discussion Performance of CONFLEX-G was observed to be almost equals to that of CONFLEX with MPI –Overheads to initialize workers was found. It will be required to imporve. We could achieve performance improvement using multiple clusters, –A speedup of 64 on 112 workers in AlaX16a(181 atoms) –However …, In our experiment: Each workers takes only one or two trial structures, too few! Load in-balance occurs because exec. time of each opt. varies. We expect more speed up for larger molecule.

22. 2003/10/3 UK Jpana N+N Meeting 22 Discussion (cont ’ d) Possible improvement: –Exploit more parallelism Parallelize the outer loop to increase the number of structure optimization at a time –Efficient Job Scheduling Heavy jobs -> fast machines light jobs -> slow machines –Can we estimate execution time ? –Parallelize worker program by SMP(OpenMP) Increase the performance of worker Reduce the number of workers

23. 2003/10/3 UK Jpana N+N Meeting 23 Summary and Future work Conflex-G: Grid-enabled molecular confirmation search. –We used OmniRPC to make it grid-enabled. –We are actually doing product-run.. For MO simulation (Docking), we are working on coarse- grain MO, as well as job submission –REMD (replica exchange program using NAMD) –FMO (Fragment MO) For QSAR –Design of ML to describe computation results –Web service interface to access the database