Zhendong Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhendong Zhang has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Ana Klimovic
ETH Zurich, Zurich, Switzerland
2 shared publications - Foteini Strati
ETH Zurich, Zurich, Switzerland
2 shared publications - Jingwen Leng
Shanghai Jiao Tong University, Shanghai, China
2 shared publications - Minyi Guo
Shanghai Jiao Tong University, Shanghai, China
2 shared publications - Quan Chen
Shanghai Jiao Tong University
2 shared publications - Weihao Cui
Shanghai Jiao Tong University, Shanghai, China
2 shared publications
Latest Publications
- Open Access
- 27 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 208-217
Characterizing Energy and Performance for Distributed Training of Large Language Models
Distributed LLM training dominates compute, power and energy consumption in modern datacenters. Parallelization strategies are tuned to to maximize training throughput under memory constraints, while GPU frequency can be adjusted to reduce power. However, these knobs are usually tuned in isolation, and their combined effect on energy efficiency is poorly understood. We evaluate how different parallelization strategies interact with GPU frequency scaling, measuring throughput, power draw, and total energy across different transformer models. We find that faster configurations generally reduce energy under fixed hardware settings, but sensitivity to reduced GPU frequency varies widely across parallelism strategies. As a result, achieving Paretooptimal performance-energy tradeoffs, requires joint optimization of parallelization strategies and GPU frequency. We provide guidelines for scheduling and modeling distributed LLM training to balance performance, power, and energy constraints.
- 27 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 208-217
Open AccessCharacterizing Energy and Performance for Distributed Training of Large Language Models
Distributed LLM training dominates compute, power and energy consumption in modern datacenters. Parallelization strategies are tuned to to maximize training throughput under memory constraints, while GPU frequency can be adjusted to reduce power. However, these knobs are usually tuned in isolation, and their combined effect on energy efficiency is poorly understood. We evaluate how different parallelization strategies interact with GPU frequency scaling, measuring throughput, power draw, and total energy across different transformer models. We find that faster configurations generally reduce energy under fixed hardware settings, but sensitivity to reduced GPU frequency varies widely across parallelism strategies. As a result, achieving Paretooptimal performance-energy tradeoffs, requires joint optimization of parallelization strategies and GPU frequency. We provide guidelines for scheduling and modeling distributed LLM training to balance performance, power, and energy constraints.
- Open Access
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 204-220
Sailor: Automating Distributed Training over Dynamic, Heterogeneous, and Geo-distributed Clusters
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 204-220
Open AccessSailor: Automating Distributed Training over Dynamic, Heterogeneous, and Geo-distributed Clusters
- Open Access
- 6 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 247-263
Voyager: Input-Adaptive Algebraic Transformations for High-Performance Graph Neural Networks
- 6 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 247-263
Open AccessVoyager: Input-Adaptive Algebraic Transformations for High-Performance Graph Neural Networks
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 52-62
AdaptGear
Graph neural networks (GNNs) are powerful tools for exploring and learning from graph structures and features. As such, achieving high-performance execution for GNNs becomes crucially important. Prior works have proposed to explore the sparsity (i.e., low density) in the input graph to accelerate GNNs, which uses the full-graph-level or block-level sparsity format. We show that they fail to balance the sparsity benefit and kernel execution efficiency. In this paper, we propose a novel system, referred to as AdaptGear, that addresses the challenge of optimizing GNNs performance by leveraging kernels tailored to the density characteristics at the subgraph level. Meanwhile, we also propose a method that dynamically chooses the optimal set of kernels for a given input graph. Our evaluation shows that AdaptGear can achieve a significant performance improvement, up to 6.49× (1.87× on average), over the state-of-the-art works on two mainstream NVIDIA GPUs across various datasets.
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 52-62
Open AccessAdaptGear
Graph neural networks (GNNs) are powerful tools for exploring and learning from graph structures and features. As such, achieving high-performance execution for GNNs becomes crucially important. Prior works have proposed to explore the sparsity (i.e., low density) in the input graph to accelerate GNNs, which uses the full-graph-level or block-level sparsity format. We show that they fail to balance the sparsity benefit and kernel execution efficiency. In this paper, we propose a novel system, referred to as AdaptGear, that addresses the challenge of optimizing GNNs performance by leveraging kernels tailored to the density characteristics at the subgraph level. Meanwhile, we also propose a method that dynamically chooses the optimal set of kernels for a given input graph. Our evaluation shows that AdaptGear can achieve a significant performance improvement, up to 6.49× (1.87× on average), over the state-of-the-art works on two mainstream NVIDIA GPUs across various datasets.