Zhiling Lan

Zhiling Lan

Auto-generated profile, based on publicly available information

Zhiling Lan

University of Illinois Chicago & Argonne National Laboratory, Chicago, IL, USA

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
21 June 2023
Verified
Conference Paper
Open access
XXXiongxiao Xu
Xiongxiao Xu
XWXin Wang
Xin Wang
ECElkin Cruz-Camacho
Elkin Cruz-Camacho
CCChristopher D. Carothers
Christopher D. Carothers
KBKevin A. Brown
Kevin A. Brown
KSKai Shu
Kai Shu
Interconnect networks play a key role in high-performance computing (HPC) systems. Parallel discrete event simulation (PDES) has been a long-standing pillar for studying large-scale networking systems by replicating the real-world behaviors of HPC facilities. However, the simulation requirements and computational complexity of PDES are growing at an intractable rate. An active research topic is to build a surrogate-ready PDES framework where an accurate surrogate model built on machine learning can be used to forecast network traffic for improving PDES. In this paper, we make the first attempt to introduce two representative time series methods, the Autoregressive Integrated Moving Average (ARIMA) and the Adaptive Long Short-Term Memory (ADP-LSTM), to forecast the traffic in interconnect networks, using the Dragonfly system as a representative example. The proposed ADP-LSTM can efficiently adapt to the ever-changing network traffic, facilitating the forecasting capability for intricate network traffic, by incorporating a novel online learning strategy. Our preliminary analysis demonstrates promising results and shows that ADP-LSTM can consistently outperform ARIMA with significantly less time overhead.

1 December 2013 in Parallel Computing
Verified
Journal Article
Closed access
WTWei Tang
Wei Tang
DRDongxu Ren
Dongxu Ren
ZLZhiling Lan
Zhiling Lan
NDNarayan Desai
Narayan Desai

21 June 2023
Verified
Conference Paper
Open access
ECElkin Cruz-Camacho
Elkin Cruz-Camacho
KBKevin A. Brown
Kevin A. Brown
XWXin Wang
Xin Wang
XXXiongxiao Xu
Xiongxiao Xu
KSKai Shu
Kai Shu
CCChristopher D. Carothers
Christopher D. Carothers

24 June 2024
Verified
Conference Paper
Open access
XXXiongxiao Xu
Xiongxiao Xu
KBKevin A. Brown
Kevin A. Brown
TMTanwi Mallick
Tanwi Mallick
XWXin Wang
Xin Wang
ECElkin Cruz-Camacho
Elkin Cruz-Camacho
KSKai Shu
Kai Shu
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.

11 April 2025 in ACM Transactions on Modeling and Computer Simulation
Verified
Journal Article
Open access
ECElkin Cruz-Camacho
Elkin Cruz-Camacho
KBKevin Brown
Kevin Brown
XWXin Wang
Xin Wang
XXXiongxiao Xu
Xiongxiao Xu
KSKai Shu
Kai Shu
CCChristopher Carothers
Christopher Carothers
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.

15 November 2025
Verified
Conference Paper
Open access
ZZZhong Zheng
Zhong Zheng
SSSeyfal Sultanov
Seyfal Sultanov
MPMichael E. Papka
Michael E. Papka
ZLZhiling Lan
Zhiling Lan