Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Zhong He

dblp:52/3055 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Systems, architecture and hardware · 2 · 2 since 2021Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 77% Distributed systems · 23%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › communication optimization
communication-computation overlap
1.012026
Exploiting the Performance Potential of Extreme-Scale Earthquake Simulation: Achieving 86.7 PFLOPS With Over 39 Million Cores · IEEE Trans. Parallel Distributed Syst. 2026
High-performance computing › scientific computing systems
earthquake simulation
1.012026
Exploiting the Performance Potential of Extreme-Scale Earthquake Simulation: Achieving 86.7 PFLOPS With Over 39 Million Cores · IEEE Trans. Parallel Distributed Syst. 2026
High-performance computing
performance optimization at scale
1.012026
Exploiting the Performance Potential of Extreme-Scale Earthquake Simulation: Achieving 86.7 PFLOPS With Over 39 Million Cores · IEEE Trans. Parallel Distributed Syst. 2026
High-performance computing
scientific computing systems
1.012026
Exploiting the Performance Potential of Extreme-Scale Earthquake Simulation: Achieving 86.7 PFLOPS With Over 39 Million Cores · IEEE Trans. Parallel Distributed Syst. 2026
High-performance computing
supercomputing
0.312026
Exploiting the Performance Potential of Extreme-Scale Earthquake Simulation: Achieving 86.7 PFLOPS With Over 39 Million Cores · IEEE Trans. Parallel Distributed Syst. 2026

Methods — techniques the papers use, named apart from their topics

vectorization · 1.0performance prediction model · 1.0data compression · 1.0
YearPublicationVenuePosition
2026 Exploiting the Performance Potential of Extreme-Scale Earthquake Simulation: Achieving 86.7 PFLOPS With Over 39 Million Cores
abstract
Leveraging the latest Sunway supercomputer, we developed a fully optimized earthquake simulation model that accurately captures topographic effects for realistic seismic analysis. Optimizing for the SW26010Pro architecture with DMA/RMA communication mechanisms, data compression schemes, and vectorization, we achieved a speedup exceeding 160×. Our pipeline-based computation and communication overlapping scheme, combined with performance prediction models further minimized computational costs. These optimizations enabled the largest-scale curvilinear grid finite-difference method (CGFDM) earthquake simulations to date, covering 197 trillion grid points and achieving 86.7 PFLOPS on 39 million cores with a weak scaling efficiency of 97.9%. These advancements enabled the successful simulation of the 2008 Wenchuan earthquake, providing high-resolution seismic insights and robust assessments for regional hazard mitigation and disaster preparedness.
Lin Gan 0008, Wubing Wan, Zekun Yin, Zhong He, Ping Gao 0005, Xiaohui Duan, Wei Xue 0003, Haohuan Fu, Guangwen Yang 0002
IEEE Trans. Parallel Distributed Syst.7
2025 SOLB: Synchronization-Objective Load Balancing for Distributed DNN Training
abstract
Distributed training is the most common way to scale out and accelerate Deep Neural Network (DNN) training. Distributed DNN training requires synchronization of gradient aggregation among all workers through collective communication operations before proceeding to the next training round. Any long-tail delay would be an obstacle to model training performance and convergence. This paper proposes a load balancing scheme SOLB for distributed DNN training acceleration, which utilizes a synchronization-objective load balancing to ensure packets with the same gradient indices from the same training job arrive at the receiver back to back, enabling optimal synchronous communication. Furthermore, leveraging the independence of parameter updates, we design an order-agnostic transmission protocol to avoid the overhead of packet reordering without affecting the training accuracy. Through both testbed and simulation experiments, our scheme significantly reduces gradient aggregation time by up to 82.5% and accelerates overall model training by up to 84.4% compared to the state-of-the-art load balancing schemes.
Jingling Liu, Zhong He, Rui Cui
ICDCS3
2025 Sadra: Size-Aware Demotion Rate Adjustment for Flow Scheduling in Data Center
abstract
Most existing flow scheduling schemes aim to minimize the flow completion time in data center network. However, these schemes either lack fine-grained flow differentiation, sacrificing performance for deployability or require precise flow information and significant hardware modifications for nearoptimal transmission. Thus, we present Sadra, a novel flow scheduling solution leveraging multiple priority queues available in existing commodity switches to minimize FCT by assigning different initial priorities and demotion thresholds to flows with various sizes. Our intuition is that the average queuing length of small flows increases as the number of large flows grows, yet reducing queuing length improves latency of small flows with negligible impact on throughput of large flows. Sadra consists of two key parts: i) A novel scheduling scheme that utilizes imprecise predictions to assign initial priorities to flows with different sizes, enabling differentiation from the outset of transmission; ii) A size-aware demotion threshold strategy that assigns different demotion thresholds to further differentiate flows with the same initial priority, thereby reducing the blocking of small flows by large ones. We have implemented a Sadra prototype and evaluated Sadra through both testbed experiments and NS3 simulations. Simulation and testbed evaluations show that Sadra significantly reduces the average and tail FCT of small flows by up to 61% and 89% compared with the state-of-the-art schemes, respectively.
Jingling Liu, Rui Cui, Zhong He, Wenjun Lyu
IWQoS5
2017 Several Logic Gates Extended from MAGIC-Memristor-Aided Logic
Lin Chen 0046, Zhong He, Xiaoping Wang 0001, Zhigang Zeng
ISNN (1)2
2000 A Neural Network Approach to Predict Existing and Infill Oil Well Performance
abstract
We put forward a neural network approach to predict existing and in-fill oil well performance. Multiple wells history production data were used to train the neural network, and the established neural network can be used to predict future performance of oil wells. No reservoir data is currently involved in the establishment of neural network, therefore it can predict well production performance in absence of reservoir data. Since both the static and dynamic data are used in the training, we combine the spatial and time series prediction together in this approach. Primary production of a 9-well area in North Robertson Unit located in west Texas was tested in this paper. The results demonstrate that our approach is powerful in rapid projection of existing wells future performance, as well as the performance prediction of in-fill drilling wells. By incorporating the appropriate optimization technique, it can be further extended for use in location optimization of in-fill drilling wells.
Linyu Yang, Zhong He, John Yen, Ching Wu
IJCNN (4)2