Rongqiang Cao

Rongqiang Cao

Auto-generated profile, based on publicly available information

Rongqiang Cao

Computer Network Information Center, Chinese Academy of Sciences

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 October 2019 in Genomics, Proteomics & Bioinformatics
Verified
Journal Article
Open access
RLRuilin Li
Ruilin Li
XHXiaoyu He
Xiaoyu He
CDChuangchuang Dai
Chuangchuang Dai
HZHaidong Zhu
Haidong Zhu
XLXianyu Lang
Xianyu Lang
Beifang NiuBeifang Niu
Beifang Niu
The accelerating growth of the public microbial genomic data imposes substantial burden on the research community that uses such resources. Building databases for non-redundant reference sequences from massive microbial genomic data based on clustering analysis is essential. However, existing clustering algorithms perform poorly on long genomic sequences. In this article, we present Gclust, a parallel program for clustering complete or draft genomic sequences, where clustering is accelerated with a novel parallelization strategy and a fast sequence comparison algorithm using sparse suffix arrays (SSAs). Moreover, genome identity measures between two sequences are calculated based on their maximal exact matches (MEMs). In this paper, we demonstrate the high speed and clustering quality of Gclust by examining four genome sequence datasets. Gclust is freely available for non-commercial use at https://github.com/niu-lab/gclust. We also introduce a web server for clustering user-uploaded genomes at http://niulab.scgrid.cn/gclust.

1 October 2017 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
CRCao Rongqiang
Cao Rongqiang
XHXiao Haili
Xiao Haili
LSLu Shasha
Lu Shasha
ZYZhao Yining
Zhao Yining
WXWang Xiaoning
Wang Xiaoning
Xuebin CHIXuebin CHI
Xuebin CHI
The development of scientific computing is increasingly moving to collaborative web and mobile applications. All these applications need high-quality programming interface for accessing heterogeneous computing resources consisting of clusters, grid computing or cloud computing. In this paper, we introduce our high-performance computing environment that integrates computing resources from 16 HPC centers across China. Then we present a bundle of web services called SCEAPI and describe how it can be used to access HPC resources with HTTP or HTTPs protocols. We discuss SCEAPI from several aspects including architecture, implementation and security, and address specific challenges in designing compatible interfaces and protecting sensitive data. We describe the functions of SCEAPI including authentication, file transfer and job management for creating, submitting and monitoring, and how to use SCEAPI in an easy-to-use way. Finally, we discuss how to exploit more HPC resources quickly for the ATLAS experiment by implementing the custom ARC compute element based on SCEAPI, and our work shows that SCEAPI is an easy-to-use and effective solution to extend opportunistic HPC resources.

6 February 2019 in Journal of Signal Processing Systems
Verified
Journal Article
Closed access
PDF file
HZHaikuo Zhang
Haikuo Zhang
ZLZhonghua Lu
Zhonghua Lu
KXKe Xu
Ke Xu
YPYuchen Pang
Yuchen Pang
FLFang Liu
Fang Liu
RCRongqiang Cao
Rongqiang Cao

13 July 2026
Verified
Conference Paper
Open access
XMXue Miao
Xue Miao
Jue WangJue Wang
Jue Wang
QLQida Lin
Qida Lin
SZShufei Zhang
Shufei Zhang
RCRongqiang Cao
Rongqiang Cao
YWYangang Wang
Yangang Wang
Nuclear reactor FSI simulation faces two key challenges: "Mapping wall" bottleneck in data transfer across non-matching mesh coupling interfaces; Low hardware utilization from multi-physics solvers’ heterogeneous core tasks (compute- vs. memory-intensive). Therefore, an innovative FSI framework integrating two strategies is proposed: Scalable radial basis function mapping—restructuring the global problem into massive independent subproblems via task partitioning, preallocation, and multi-granularity load balancing to eliminate communication overhead; Dependency-aware multi-stream optimization—deeply overlapping heterogeneous solver tasks to maximize hardware utilization. It first achieves parameter transfer across ∼90,000 non-matching coupling interfaces in China Experimental Fast Reactor, with 86.36% strong scaling and 94.01% weak scaling. The combined optimizations yield ∼60% performance gain, increase strong scaling by over 20 percentage points, and achieve high weak scaling of ∼97%. Moreover, the FSI results align well with publicly available data, verifying its correctness.

21 November 2019
Verified
Conference Paper
Open access
PDF file
RCRongqiang Cao
Rongqiang Cao
Yangang WangYangang Wang
Yangang Wang
Xuebin CHIXuebin CHI
Xuebin CHI
RHRong He
Rong He
SLShasha Lu
Shasha Lu
XWXiaoning Wang
Xiaoning Wang
Through grid computing and cloud computing technologies, SCE (Scientific Computing Environment) integrates massive computing, storage and application resources. These resources are packaged as easy-to-use open APIs in RESTful web services. These APIs are used to develop terminal software for multi-disciplinary and cross-scenario. Around authentication and authorization issues among users, several services for open APIs, authentication and authorization are proposed and implemented in this paper. The proposed services provide single sign-on for several WEB communities by SCE accounts, support users to authorize terminal software that could access massive resources and personal private data in proxy mode, and also help administrators determine which open APIs a client could access. Atop the proposed services, all related people consisting of users, developers and administrators, no longer need to worry about and solve complex problems with authentication and authorization. What they need to pay much attention on are specific business logics and application scenarios for their interested areas. The proposed services have been applied to general computing portal, operation and management portal in national high-performance computing environment, and also WEB communities for computational chemistry, bioinformatics, etc. These examples show that the proposed services have achieved good performance and user experience.

25 September 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
JGJunyu Gu
Junyu Gu
Jue WangJue Wang
Jue Wang
ZXZhikuang Xin
Zhikuang Xin
CZChunbao Zhou
Chunbao Zhou
ZLZhiqiang Liang
Zhiqiang Liang
YWYangang Wang
Yangang Wang
Sparse matrix-dense matrix multiplication (SpMM) is a core operation in scientific computing and deep learning. On multi-GPU platforms, its scalability is limited by communication bottlenecks. To address this, we propose DistSpMM, a co-design framework integrating data layout, pipelining, and communication strategies. DistSpMM introduces HSDMA, a lightweight algorithm that reduces communication by optimizing the dense matrix allocation. DistSpMM features a topology-aware two-stage pipeline that manages the IB/NVLink bandwidth disparity to maximize the overlap of computation and communication. Finally, DistSpMM employs an adaptive selector that uses a performance model to dynamically choose the optimal communication granularity (coarse vs. fine-grained) based on data sparsity and network tier. Experiments on diverse real-world datasets demonstrate the superior performance of our method. It achieves average speedups of 1.6× to 2.6× in single-node multi-GPU environments and 4.0× to 5.1× in multi-node multi-GPU environments over the baseline. Compared to the best state-of-the-art implementations, our method delivers up to 2.0× speedup.