Ligand discovery on massively parallel systems

被引:5
作者
Shave, S. R. [1 ]
Taylor, P. [1 ]
Walkinshaw, M. [1 ]
Smith, L. [2 ]
Hardy, J. [2 ]
Trew, A. [2 ]
机构
[1] Univ Edinburgh, Inst Struct & Mol Biol, Sch Biol Sci, Edinburgh EH9 3JR, Midlothian, Scotland
[2] Univ Edinburgh, Sch Phys, EPCC, Edinburgh EH9 3JZ, Midlothian, Scotland
关键词
D O I
10.1147/rd.521.0057
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Virtual screening is an approach for identifying promising leads for drugs and is used in the pharmaceutical industry. We present the parallelization of LIDAEUS (LIgand Discovery At Edinburgh UniverSity), creating a massively parallel high- throughput virtual-screening code. This program is being used to predict the binding modes involved in the docking of small ligands to proteins. Parallelization efforts have focused on achieving maximum parallel efficiency and developing a memory-efficient parallel sorting routine. Using an IBM Blue Gene/L (TM) supercomputer, runtimes have been reduced from 8 days on a modest seven-node cluster to 62 minutes on 1,024 processors using a standard dataset of 1.67 million small molecules and FKBP12, a protein target of interest in immunosuppressive therapies. Using more-complex datasets, the code scales upward to make use of the full processor set of 2,048. The code has been successfully used,for the task of gathering data on approximately 1.67 million small molecules binding to approximately 400 high-quality crystallographically determined ligand-bound protein structures, generating data on more than 646 million protein-ligand complexes. A number of novel ligands have already been discovered and validated experimentally.
引用
收藏
页码:57 / 67
页数:11
相关论文
共 50 条
  • [41] SEP: A fixed degree regular network for massively parallel systems
    Univ of Nevada, United States
    J Supercomput, 3 (277-291):
  • [42] Molecular simulation of complex systems using massively parallel supercomputers
    Cummings, PT
    FLUID PHASE EQUILIBRIA, 1998, 144 (1-2) : 331 - 342
  • [43] APPLICATION OF THE MASSIVELY PARALLEL PROCESSOR TO DATABASE-MANAGEMENT SYSTEMS
    DAVIS, EW
    AFIPS CONFERENCE PROCEEDINGS, 1983, 52 : 299 - &
  • [44] miniVite: A Graph Analytics Benchmarking Tool for Massively Parallel Systems
    Ghosh, Sayan
    Halappanavar, Mahantesh
    Tumeo, Antonino
    Kalyanaraman, Ananth
    Gebremedhin, Assefaw H.
    PROCEEDINGS OF 2018 IEEE/ACM PERFORMANCE MODELING, BENCHMARKING AND SIMULATION OF HIGH PERFORMANCE COMPUTER SYSTEMS (PMBS 2018), 2018, : 51 - 56
  • [45] A Guide to Formal Analysis of Join Processing in Massively Parallel Systems
    Koutris, Paraschos
    Suciu, Dan
    SIGMOD RECORD, 2016, 45 (04) : 18 - 27
  • [46] Scalable mpNoC for massively parallel systems - Design and implementation on FPGA
    Baklouti, M.
    Aydi, Y.
    Marquet, Ph.
    Dekeyser, J. L.
    Abid, M.
    JOURNAL OF SYSTEMS ARCHITECTURE, 2010, 56 (07) : 278 - 292
  • [47] Massively parallel preconditioners for symmetric positive definite linear systems
    Alouges, F
    Loreaux, P
    NUMERICAL ALGORITHMS, 1997, 14 (04) : 361 - 375
  • [48] MASSIVELY PARALLEL IMAGE RECOGNITION SYSTEMS FOR REMOTELY SENSED DATA
    TENORIO, MF
    KUHL, FP
    TECHNICAL PAPERS : 1989 ASPRS/ACSM ANNUAL CONVENTION, VOL 5: SURVEYING & CARTOGRAPHY, 1989, : 48 - 57
  • [49] On modelling of an adaptive routing algorithm for massively parallel processing systems
    Ciciani, Bruno
    Tucci, Salvatore
    Simulation Practice and Theory, 1995, 2 (06): : 237 - 255
  • [50] Dynamic Memory Management in Massively Parallel Systems: A Case on GPUs
    Pham, Minh
    Li, Hao
    Yuan, Yongke
    Mou, Chengcheng
    Ramachandran, Kandethody
    Xu, Zichen
    PROCEEDINGS OF THE 36TH ACM INTERNATIONAL CONFERENCE ON SUPERCOMPUTING, ICS 2022, 2022,