基于异构计算的配体-受体结合过程的分子对接

Sci. Program. Pub Date : 2022-01-10 DOI:10.1155/2022/9197606
Jianhua Li, Guanlong Liu, Zhiyuan Zhen, Zihao Shen, Shiliang Li, Honglin Li
{"title":"基于异构计算的配体-受体结合过程的分子对接","authors":"Jianhua Li, Guanlong Liu, Zhiyuan Zhen, Zihao Shen, Shiliang Li, Honglin Li","doi":"10.1155/2022/9197606","DOIUrl":null,"url":null,"abstract":"Molecular docking aims to predict possible drug candidates for many diseases, and it is computationally intensive. Particularly, in simulating the ligand-receptor binding process, the binding pocket of the receptor is divided into subcubes, and when the ligand is docked into all cubes, there are many molecular docking tasks, which are extremely time-consuming. In this study, we propose a heterogeneous parallel scheme of molecular docking for the binding process of ligand to receptor to accelerate simulating. The parallel scheme includes two layers of parallelism, a coarse-grained layer of parallelism implemented in the message-passing interface (MPI) and a fine-grained layer of parallelism focused on the graphics processing unit (GPU). At the coarse-grain layer of parallelism, a docking task inside one lattice is assigned to one unique MPI process, and a grouped master-slave mode is used to allocate and schedule the tasks. Meanwhile, at the fine-gained layer of parallelism, GPU accelerators undertake the computationally intensive computing of scoring functions and related conformation spatial transformations in a single docking task. The results of the experiments for the ligand-receptor binding process show that on a multicore server with GPUs the parallel program has achieved a speedup ratio as high as 45 times in flexible docking and as high as 54.5 times in semiflexible docking, and on a distributed memory system, the docking time for flexible docking and that for semiflexible docking gradually decrease as the number of nodes used in the parallel program gradually increases. The scalability of the parallel program is also verified in multiple nodes on a distributed memory system and is approximately linear.","PeriodicalId":21628,"journal":{"name":"Sci. Program.","volume":"61 1","pages":"9197606:1-9197606:13"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Molecular Docking for Ligand-Receptor Binding Process Based on Heterogeneous Computing\",\"authors\":\"Jianhua Li, Guanlong Liu, Zhiyuan Zhen, Zihao Shen, Shiliang Li, Honglin Li\",\"doi\":\"10.1155/2022/9197606\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Molecular docking aims to predict possible drug candidates for many diseases, and it is computationally intensive. Particularly, in simulating the ligand-receptor binding process, the binding pocket of the receptor is divided into subcubes, and when the ligand is docked into all cubes, there are many molecular docking tasks, which are extremely time-consuming. In this study, we propose a heterogeneous parallel scheme of molecular docking for the binding process of ligand to receptor to accelerate simulating. The parallel scheme includes two layers of parallelism, a coarse-grained layer of parallelism implemented in the message-passing interface (MPI) and a fine-grained layer of parallelism focused on the graphics processing unit (GPU). At the coarse-grain layer of parallelism, a docking task inside one lattice is assigned to one unique MPI process, and a grouped master-slave mode is used to allocate and schedule the tasks. Meanwhile, at the fine-gained layer of parallelism, GPU accelerators undertake the computationally intensive computing of scoring functions and related conformation spatial transformations in a single docking task. The results of the experiments for the ligand-receptor binding process show that on a multicore server with GPUs the parallel program has achieved a speedup ratio as high as 45 times in flexible docking and as high as 54.5 times in semiflexible docking, and on a distributed memory system, the docking time for flexible docking and that for semiflexible docking gradually decrease as the number of nodes used in the parallel program gradually increases. The scalability of the parallel program is also verified in multiple nodes on a distributed memory system and is approximately linear.\",\"PeriodicalId\":21628,\"journal\":{\"name\":\"Sci. Program.\",\"volume\":\"61 1\",\"pages\":\"9197606:1-9197606:13\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sci. Program.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1155/2022/9197606\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sci. Program.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2022/9197606","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

分子对接旨在预测许多疾病可能的候选药物,它是计算密集型的。特别是在模拟配体与受体结合过程中,受体的结合袋被划分为多个亚立方体,当配体与所有立方体对接时,有许多分子对接任务,非常耗时。在本研究中,我们提出了一种异质平行分子对接方案,以加速配体与受体结合过程的模拟。并行方案包括两层并行性,在消息传递接口(MPI)中实现的粗粒度并行性层和专注于图形处理单元(GPU)的细粒度并行性层。在粗粒度并行层,将一个格子内的对接任务分配给一个唯一的MPI进程,并使用分组主从模式来分配和调度任务。同时,在精细获得的并行层,GPU加速器承担单个对接任务中评分函数和相关构象空间变换的计算密集型计算。配体-受体结合过程的实验结果表明,在具有gpu的多核服务器上,并行程序在灵活对接时的加速比高达45倍,在半灵活对接时的加速比高达54.5倍;在分布式存储系统上,随着并行程序使用的节点数量逐渐增加,灵活对接和半灵活对接的对接时间逐渐减少。并行程序的可扩展性也在分布式存储系统的多个节点上得到验证,并且近似线性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Molecular Docking for Ligand-Receptor Binding Process Based on Heterogeneous Computing
Molecular docking aims to predict possible drug candidates for many diseases, and it is computationally intensive. Particularly, in simulating the ligand-receptor binding process, the binding pocket of the receptor is divided into subcubes, and when the ligand is docked into all cubes, there are many molecular docking tasks, which are extremely time-consuming. In this study, we propose a heterogeneous parallel scheme of molecular docking for the binding process of ligand to receptor to accelerate simulating. The parallel scheme includes two layers of parallelism, a coarse-grained layer of parallelism implemented in the message-passing interface (MPI) and a fine-grained layer of parallelism focused on the graphics processing unit (GPU). At the coarse-grain layer of parallelism, a docking task inside one lattice is assigned to one unique MPI process, and a grouped master-slave mode is used to allocate and schedule the tasks. Meanwhile, at the fine-gained layer of parallelism, GPU accelerators undertake the computationally intensive computing of scoring functions and related conformation spatial transformations in a single docking task. The results of the experiments for the ligand-receptor binding process show that on a multicore server with GPUs the parallel program has achieved a speedup ratio as high as 45 times in flexible docking and as high as 54.5 times in semiflexible docking, and on a distributed memory system, the docking time for flexible docking and that for semiflexible docking gradually decrease as the number of nodes used in the parallel program gradually increases. The scalability of the parallel program is also verified in multiple nodes on a distributed memory system and is approximately linear.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Liquid Democracy Enabled Blockchain-Based Electronic Voting System Bike-Sharing Fleet Allocation Optimization Based on Demand Gap and Cycle Rebalancing Strategies Research on the Intelligent Assignment Model of Urban Traffic Planning Based on Optimal Path Optimization Algorithm Online Teaching Wireless Video Stream Resource Dynamic Allocation Method considering Node Ability The Path of Film and Television Animation Creation Using Virtual Reality Technology under the Artificial Intelligence
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1