Zhiling Lan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zhiling Lan has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Xin Wang
Computer Science, University of Illinois Chicago, Chicago, United States
10 shared publications - Christopher D. Carothers
Rensselaer Polytechnic Institute, Troy, NY, USA
8 shared publications - Kevin A. Brown
Argonne National Laboratory
8 shared publications - Robert Ross
Argonne National Laboratory, Lemont, USA
8 shared publications - Elkin Cruz-Camacho
Computer Science, Rensselaer Polytechnic Institute, Troy, United States
5 shared publications - Kai Shu
Emory University, Atlanta, GA, USA
4 shared publications
Latest Publications
- Open Access
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 175-187
SmartCap: Coordinated CPU–GPU Power Capping for Performance-Assurance Energy Efficiency
Large-scale systems face strict power limits when running heterogeneous CPU–GPU applications that exhibit varying responses to power caps. Existing power capping methods either target GPUs or CPUs alone or require extensive per-application profiling, making them impractical for production environments. We present SmartCap, an online framework that coordinates CPU–GPU power capping to reduce energy consumption while bounding performance degradation under a user specified threshold. SmartCap combines an offline phase, which builds a performance model and initializes a performance–power matrix, with an online phase that employs lightweight profiling and collaborative filtering to infer performance across the CPU–GPU cap space. Performance evaluation on three heterogeneous systems with a diverse workload suite shows that SmartCap achieves 95% mean prediction accuracy and as much as 20% energy savings, with negligible runtime overhead for most applications, demonstrating its practicality for performance-aware energy optimization in production environments.
- 5 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 175-187
Open AccessSmartCap: Coordinated CPU–GPU Power Capping for Performance-Assurance Energy Efficiency
Large-scale systems face strict power limits when running heterogeneous CPU–GPU applications that exhibit varying responses to power caps. Existing power capping methods either target GPUs or CPUs alone or require extensive per-application profiling, making them impractical for production environments. We present SmartCap, an online framework that coordinates CPU–GPU power capping to reduce energy consumption while bounding performance degradation under a user specified threshold. SmartCap combines an offline phase, which builds a performance model and initializes a performance–power matrix, with an online phase that employs lightweight profiling and collaborative filtering to infer performance across the CPU–GPU cap space. Performance evaluation on three heterogeneous systems with a diverse workload suite shows that SmartCap achieves 95% mean prediction accuracy and as much as 20% energy savings, with negligible runtime overhead for most applications, demonstrating its practicality for performance-aware energy optimization in production environments.
- Open Access
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 505-518
Minimizing Power Waste in Heterogenous Computing via Adaptive Uncore Scaling
- 15 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 505-518
Open AccessMinimizing Power Waste in Heterogenous Computing via Adaptive Uncore Scaling
- Open Access
- 12 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 35 (4) , 1-18
MFNetSim: A Multi-Fidelity Network Simulation Framework for Multi-Traffic Modeling of Dragonfly Systems
In high-performance computing (HPC), modern supercomputers typically provide exclusive computing resources to user applications. Nevertheless, the interconnect network is a shared resource for both inter-node communication and across-node I/O access, among co-running workloads, leading to inevitable network interference. In this study, we develop MFNetSim, a multi-fidelity modeling framework that enables simulation of multi-traffic simultaneously over the interconnect network, including inter-process communication and I/O traffic. By combining different levels of abstraction, MFNetSim can efficiently co-model the communication and I/O traffic occurring on HPC systems equipped with flash-based storage. We conduct simulation studies of hybrid workloads composed of traditional HPC applications and emerging ML applications on a 1,056-node Dragonfly system with various configurations. Our analysis provides various observations regarding how network interference affects communication and I/O traffic.
- 12 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 35 (4) , 1-18
Open AccessMFNetSim: A Multi-Fidelity Network Simulation Framework for Multi-Traffic Modeling of Dragonfly Systems
In high-performance computing (HPC), modern supercomputers typically provide exclusive computing resources to user applications. Nevertheless, the interconnect network is a shared resource for both inter-node communication and across-node I/O access, among co-running workloads, leading to inevitable network interference. In this study, we develop MFNetSim, a multi-fidelity modeling framework that enables simulation of multi-traffic simultaneously over the interconnect network, including inter-process communication and I/O traffic. By combining different levels of abstraction, MFNetSim can efficiently co-model the communication and I/O traffic occurring on HPC systems equipped with flash-based storage. We conduct simulation studies of hybrid workloads composed of traditional HPC applications and emerging ML applications on a 1,056-node Dragonfly system with various configurations. Our analysis provides various observations regarding how network interference affects communication and I/O traffic.
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 154-164
CQSim+: Symbiotic Simulation for Multi-Resource Scheduling in High-Performance Computing
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 154-164
Open AccessCQSim+: Symbiotic Simulation for Multi-Resource Scheduling in High-Performance Computing
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 110-114
Directing PDES and Surrogate Models in Loosely Coupled Hybrid Simulations
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 110-114
Open AccessDirecting PDES and Surrogate Models in Loosely Coupled Hybrid Simulations
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 120-121
Synopsis: MFNetSim: A Multi-Fidelity Network Simulation Framework for Multi-Traffic Modeling of Dragonfly Systems
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 120-121
Open AccessSynopsis: MFNetSim: A Multi-Fidelity Network Simulation Framework for Multi-Traffic Modeling of Dragonfly Systems
- Open Access
- 4 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 103-114
Analyzing a Lifetime of Failures on a Cray XC40 Supercomputer
- 4 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 103-114
Open AccessAnalyzing a Lifetime of Failures on a Cray XC40 Supercomputer
- Open Access
- 11 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 35 (2) , 1-22
Preventing Workload Interference with Intelligent Routing and Flexible Job Placement Strategy on Dragonfly System
Dragonfly is an indispensable interconnect topology for exascale high-performance computing (HPC) systems. To link tens of thousands of compute nodes at a reasonable cost, Dragonfly shares network resources with the entire system such that network bandwidth is not exclusive to any single application. Since HPC systems are usually shared among multiple co-running applications at the same time, network competition between co-existing workloads is inevitable. This network contention manifests as workload interference, in which a job’s network communication can be severely delayed by other jobs. This study presents a comprehensive examination of leveraging intelligent routing and flexible job placement to mitigate workload interference on Dragonfly systems. Specifically, we leverage the parallel discrete event simulation toolkit, the Structural Simulation Toolkit (SST), to investigate workload interference on Dragonfly with three contributions. We first present Q-adaptive routing, a multi-agent reinforcement learning routing scheme, and a flexible job placement strategy that, together, can mitigate workload interference based on workload communication characteristics. Next, we enhance SST with Q-adaptive routing and develop an automatic module that serves as the bridge between the SST and HPC job scheduler for automatic simulation configuration and automated simulation launching. Finally, we extensively examine workload interference under various job placement and routing configurations.
- 11 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 35 (2) , 1-22
Open AccessPreventing Workload Interference with Intelligent Routing and Flexible Job Placement Strategy on Dragonfly System
Dragonfly is an indispensable interconnect topology for exascale high-performance computing (HPC) systems. To link tens of thousands of compute nodes at a reasonable cost, Dragonfly shares network resources with the entire system such that network bandwidth is not exclusive to any single application. Since HPC systems are usually shared among multiple co-running applications at the same time, network competition between co-existing workloads is inevitable. This network contention manifests as workload interference, in which a job’s network communication can be severely delayed by other jobs. This study presents a comprehensive examination of leveraging intelligent routing and flexible job placement to mitigate workload interference on Dragonfly systems. Specifically, we leverage the parallel discrete event simulation toolkit, the Structural Simulation Toolkit (SST), to investigate workload interference on Dragonfly with three contributions. We first present Q-adaptive routing, a multi-agent reinforcement learning routing scheme, and a flexible job placement strategy that, together, can mitigate workload interference based on workload communication characteristics. Next, we enhance SST with Q-adaptive routing and develop an automatic module that serves as the bridge between the SST and HPC job scheduler for automatic simulation configuration and automated simulation launching. Finally, we extensively examine workload interference under various job placement and routing configurations.
- Open Access
- 11 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 35 (2) , 1-19
Hybrid PDES Simulation of HPC Networks Using Zombie Packets
Although high-fidelity network simulations have proven to be reliable and cost-effective tools to peer into architectural questions for high-performance computing (HPC) networks, they incur a high resource cost. The time spent in simulating a single millisecond of network traffic in the highest detail can take hours, even for static, well-behaved traffic patterns such as uniform random. Surrogate models offer a significant reduction in runtime, yet they cannot serve as complete replacements and should only be used when appropriate. Thus, there is a need for hybrid modeling, where high-fidelity simulation and surrogates run side-by-side. We present a surrogate model for HPC networks in which: packets bypass the network, while the network state is left untouched, i.e., suspended. To bypass the network, we use historical data to estimate the arrival time at which every packet should be scheduled at; to suspend the network, all in-flight packets are scheduled to arrive at their destinations, and are kept in the system to awaken as zombies when switching back to high-fidelity. Speedup for a hybrid model is relative to the proportion of surrogate to high-fidelity. This light-weight surrogate obtained up to 76× speedup. Keeping the zombies in the network showed an increase in the accuracy of the high-fidelity simulation on restart when compared to restarting the network from an empty state.
- 11 April 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Computer Simulation
- Vol. 35 (2) , 1-19
Open AccessHybrid PDES Simulation of HPC Networks Using Zombie Packets
Although high-fidelity network simulations have proven to be reliable and cost-effective tools to peer into architectural questions for high-performance computing (HPC) networks, they incur a high resource cost. The time spent in simulating a single millisecond of network traffic in the highest detail can take hours, even for static, well-behaved traffic patterns such as uniform random. Surrogate models offer a significant reduction in runtime, yet they cannot serve as complete replacements and should only be used when appropriate. Thus, there is a need for hybrid modeling, where high-fidelity simulation and surrogates run side-by-side. We present a surrogate model for HPC networks in which: packets bypass the network, while the network state is left untouched, i.e., suspended. To bypass the network, we use historical data to estimate the arrival time at which every packet should be scheduled at; to suspend the network, all in-flight packets are scheduled to arrive at their destinations, and are kept in the system to awaken as zombies when switching back to high-fidelity. Speedup for a hybrid model is relative to the proportion of surrogate to high-fidelity. This light-weight surrogate obtained up to 76× speedup. Keeping the zombies in the network showed an increase in the accuracy of the high-fidelity simulation on restart when compared to restarting the network from an empty state.
- Open Access
- 24 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 93-97
Surrogate Modeling for HPC Application Iteration Times Forecasting with Network Features
Interconnect networks are the foundation for modern high performance computing (HPC) systems. Parallel discrete event simulation (PDES), serving as a cornerstone in the study of large-scale networking systems by modeling and simulating the real-world behaviors of HPC facilities, faces escalating computational complexities at an unsustainable scale. The research community is interested in building a surrogate-ready PDES framework where an accurate surrogate model can be used to forecast HPC behaviors and replace computationally expensive PDES phases. In this paper, we focus on forecasting application iteration times, the key indicator of large-scale networking performance, with network features, such as bandwidth-consumed and busy time on routers. We introduce five representative methods, including LAST, Average, ARIMA, LSTM, and the proposed framework LSTM-Feat, to forecast the iteration times of an exemplar application MILC running on a dragonfly system. By incorporating network features, LSTM-Feat can understand dependencies between network features and iteration times, thus facilitating forecasts. The experiments demonstrate the effectiveness of incorporating network features into surrogate models and the potential of surrogate models to accelerate PDES.
- 24 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 93-97
Open AccessSurrogate Modeling for HPC Application Iteration Times Forecasting with Network Features
Interconnect networks are the foundation for modern high performance computing (HPC) systems. Parallel discrete event simulation (PDES), serving as a cornerstone in the study of large-scale networking systems by modeling and simulating the real-world behaviors of HPC facilities, faces escalating computational complexities at an unsustainable scale. The research community is interested in building a surrogate-ready PDES framework where an accurate surrogate model can be used to forecast HPC behaviors and replace computationally expensive PDES phases. In this paper, we focus on forecasting application iteration times, the key indicator of large-scale networking performance, with network features, such as bandwidth-consumed and busy time on routers. We introduce five representative methods, including LAST, Average, ARIMA, LSTM, and the proposed framework LSTM-Feat, to forecast the iteration times of an exemplar application MILC running on a dragonfly system. By incorporating network features, LSTM-Feat can understand dependencies between network features and iteration times, thus facilitating forecasts. The experiments demonstrate the effectiveness of incorporating network features into surrogate models and the potential of surrogate models to accelerate PDES.