Ming Ling

Dr. Ming Ling

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 May 2022 in Molecules
Verified
Journal Article
Open access
PDF file
STShidi Tang
Shidi Tang
RCRuiqi Chen
Ruiqi Chen
MLMengru Lin
Mengru Lin
QLQingde Lin
Qingde Lin
YZYanxiang Zhu
Yanxiang Zhu
JWJiansheng Wu
Jiansheng Wu
AutoDock Vina is one of the most popular molecular docking tools. In the latest benchmark CASF-2016 for comparative assessment of scoring functions, AutoDock Vina won the best docking power among all the docking tools. Modern drug discovery is facing a common scenario of large virtual screening of drug hits from huge compound databases. Due to the seriality characteristic of the AutoDock Vina algorithm, there is no successful report on its parallel acceleration with GPUs. Current acceleration of AutoDock Vina typically relies on the stack of computing power as well as the allocation of resource and tasks, such as the VirtualFlow platform. The vast resource expenditure and the high access threshold of users will greatly limit the popularity of AutoDock Vina and the flexibility of its usage in modern drug discovery. In this work, we proposed a new method, Vina-GPU, for accelerating AutoDock Vina with GPUs, which is greatly needed for reducing the investment for large virtual screens and also for wider application in large-scale virtual screening on personal computers, station servers or cloud computing, etc. Our proposed method is based on a modified Monte Carlo using simulating annealing AI algorithm. It greatly raises the number of initial random conformations and reduces the search depth of each thread. Moreover, a classic optimizer named BFGS is adopted to optimize the ligand conformations during the docking progress, before a heterogeneous OpenCL implementation was developed to realize its parallel acceleration leveraging thousands of GPU cores. Large benchmark tests show that Vina-GPU reaches an average of 21-fold and a maximum of 50-fold docking acceleration against the original AutoDock Vina while ensuring their comparable docking accuracy, indicating its potential for pushing the popularization of AutoDock Vina in large virtual screens.

19 March 2019 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
Kaiyang LiuKaiyang Liu
Kaiyang Liu
JPJun Peng
Jun Peng
LHLiang He
Liang He
JPJianping Pan
Jianping Pan
SLShuo Li
Shuo Li
ZHZhiwu Huang
Zhiwu Huang
Recent years have witnessed the flourish of new promising technologies to prolong the lifetime of wireless sensor networks (WSNs). Employing mobile vehicles for wireless charging and data collection is able to balance the load of WSNs, and meanwhile, provide a reliable energy replenishment for sustainable network operations. Different from traditional charging scheduling policies where sensor nodes passively wait for the arrival of mobile vehicles, a novel dynamic clustering based mobile-to-cluster (M2C) scheme is proposed to optimize the service process for both sensor nodes and the vehicle in an active way. Requiring only local residual energy information, M2C refreshes the cluster-based network topology to ensure no sensor nodes will run out of energy before getting charged. By estimating the energy consumption of being a cluster head, the sensor nodes with residual energy close to the estimation are actively elected as head nodes. More head nodes with low residual energy will be visited, reducing the travel distance along with a higher energy efficiency of charging. Furthermore, the convergence and worst-case performance of M2C are theoretically analyzed. Performance evaluation results show that compared with the state-of-the-art schemes, our design reduces the travel distance and charging latency by about 10% and 50%, respectively.

13 October 2023 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
XZXingxing Zhou
Xingxing Zhou
MLMing Ling
Ming Ling
QLQingde Lin
Qingde Lin
STShidi Tang
Shidi Tang
JWJiansheng Wu
Jiansheng Wu
HHHaifeng Hu
Haifeng Hu
Simulated Annealing (SA) algorithm is not effective with large optimization problems for its slow convergence. Hence, several parallel Simulated Annealing (pSA) methods have been proposed, where the increase of searching threads can boost the speed of convergence. Although satisfactory solutions can be obtained by these methods, there is no rigorous mathematical analyses on their effectiveness. Thus, this paper introduces a probabilistic model, on which a theorem about the effectiveness of multiple initial states parallel SA (MISPSA) has been proven. The theorem also demonstrates that the increasing parallelism in pSA algorithm with the reducing of search depth in each thread could obtain almost the same probability of finding the global optimal solution. We validated our theorem on AutoDock Vina, a widely used molecular docking tool with high accuracy and docking speed. AutoDock Vina uses a pSA strategy to find optimal molecular conformations. Under the premise that the total searching workload (i.e., thread number * iteration depth of each thread) remains unchanged, the docking accuracy from an aggressively parallelized SA searching method is almost the same or even better than those from the default exhaustiveness (parallelism degree) configuration of AutoDock Vina. Taking complex '1hnn' as an example,with the increase (125x) in the number of initial states (from 8 to 1000) and the decrease in the search depth for each thread (from 15540 to 124, or 1/125 of the original search depth), the mean energy is -7.80 and -7.94, while the mean RMSD is 3.4 and 3.14, respectively. The result also implies that a considerable speedup (in this case 125x in theory) can be obtained by a highly parallelized SA algorithm implementation.

4 November 2022 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
MLMing Ling
Ming Ling
QLQingde Lin
Qingde Lin
RCRuiqi Chen
Ruiqi Chen
HQHaimeng Qi
Haimeng Qi
MLMengru Lin
Mengru Lin
JWJiansheng Wu
Jiansheng Wu
Molecular docking (MD) is one of the core steps in the expensive and time-consuming process of drug design, which is basically an optimization problem based on scoring functions. AutoDock series MD software is widely accepted by academia and industry, among which AutoDock Vina (Vina) is the latest and most popular version due to its accuracy and relatively high speed. However, contrast to its prior version, i.e., AutoDock4, hardware acceleration approaches of Vina are rarely reported. In this article, we propose Vina-field-programmable gate array (FPGA), a hardware-accelerated Vina implementation with FPGA that exploits the low-level parallelism. First, the fixed-point quantization is analyzed and realized to accelerate the MD algorithm with a better energy efficiency in hardware. To boost the performance of the module-level computation, multiple in- module hardware pipelines have been designed and implemented. Besides, a strategy for fast accessing to block RAM (BRAM) is implemented by utilizing the layout of data, which brings four times memory access speed to the intermolecular and intramolecular energy computing modules. Under the same 140 ligand–receptor benchmarks, Vina-FPGA performs up to $6.9\times $ (average $3.7\times$ ) faster than a state-of-the-art CPU does while consuming only 2.5% energy with similar docking accuracies. Compared to the GPU-accelerated implementation or Vina-GPU, the average energy consumption of Vina-FPGA is merely 45%.

5 September 2019 in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Verified
Journal Article
Closed access
SSShan Shen
Shan Shen
TSTianxiang Shao
Tianxiang Shao
XSXiaojing Shang
Xiaojing Shang
YGYichen Guo
Yichen Guo
MLMing Ling
Ming Ling
LSLongxing Shi
Longxing Shi
To mitigate the ever-worsening “power wall” problem, more and more applications need to expand their working voltage to the wide-voltage range including the nearthreshold region. However, the read delay distribution of the static random access memory (SRAM) cells under the nearthreshold voltage shows a more serious long-tail characteristic than that under the nominal voltage due to the process fluctuation. Such degradation of SRAM delay makes the SRAM-based cache a performance bottleneck of systems as well. To avoid unreliable data reading, circuit-level studies use larger/more transistors in a bitcell by sacrificing chip area and the static power of cache arrays. Architectural studies propose the auxiliary error correction or block disabling/remapping methods in fault-tolerant caches, which worsen both the hit latency and energy efficiency due to the complex accessing logic. This article proposes a timing-speculation (TS) cache to boost the cache frequency and improve energy efficiency under low supply voltages. In the TS cache, the voltage differences of bitlines (BLs) are continuously evaluated twice by a sense amplifier (SA), and the access timing error can be detected much earlier than that in prior methods. According to the measurement results from the fabricated chips, the TS L1 cache aggressively increases its frequency to 1.62× and 1.92× compared with the conventional scheme at 0.5- and 0.6-V supply voltages, respectively.

22 December 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
RCRuiqi Chen
Ruiqi Chen
TWTianyu Wu
Tianyu Wu
YZYuchen Zheng
Yuchen Zheng
MLMing Ling
Ming Ling
In Internet of Things (IoT) scenarios, it is challenging to deploy Machine Learning (ML) algorithms on low-cost Field Programmable Gate Arrays (FPGAs) in a real-time, cost-efficient, and high-performance way. This paper introduces Machine Learning on FPGA (MLoF), a series of ML IP cores implemented on the low-cost FPGA platforms, aiming at helping more IoT developers to achieve comprehensive performance in various tasks. With Verilog, we deploy and accelerate Artificial Neural Networks (ANNs), Decision Trees (DTs), K-Nearest Neighbors (k-NNs), and Support Vector Machines (SVMs) on 10 different FPGA development boards from seven producers. Additionally, we analyze and evaluate our design with six datasets, and compare the best-performing FPGAs with traditional SoC-based systems including NVIDIA Jetson Nano, Raspberry Pi 3B+, and STM32L476 Nucle. The results show that Lattice’s ICE40UP5 achieves the best overall performance with low power consumption, on which MLoF averagely reduces power by 891% and increases performance by 9 times. Moreover, its cost, power, Latency Production (CPLP) outperforms SoC-based systems by 25 times, which demonstrates the significance of MLoF in endpoint deployment of ML algorithms. Furthermore, we make all of the code open-source in order to promote future research.