Zhiling Lan

Zhiling Lan

Auto-generated profile, based on publicly available information

Zhiling Lan

Department of Computer Science Illinois Institute of Technology Chicago IL USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
28 February 2018
Verified
Book Chapter
Closed access
PDF file
WAWilliam Allcock
William Allcock
PRPaul Rich
Paul Rich
YFYuping Fan
Yuping Fan
ZLZhiling Lan
Zhiling Lan

15 November 2014 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
JWJingjin Wu
Jingjin Wu
XXXuanxing Xiong
Xuanxing Xiong
ZLZhiling Lan
Zhiling Lan

4 August 2017 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
EBEduardo Berrocal
Eduardo Berrocal
LBLeonardo Bautista-Gomez
Leonardo Bautista-Gomez
SDSheng Di
Sheng Di
ZLZhiling Lan
Zhiling Lan
FCFranck Cappello
Franck Cappello
Silent data corruption (SDC) poses a great challenge for high-performance computing (HPC) applications as we move to extreme-scale systems. Mechanisms have been proposed that are able to detect SDC in HPC applications by using the peculiarities of the data (more specifically, its “smoothness” in time and space) to make predictions. However, these data-analytic solutions are still far from fully protecting applications to a level comparable with more expensive solutions such as full replication. In this work, we propose partial replication to overcome this limitation. More specifically, we have observed that not all processes of an MPI application experience the same level of data variability at exactly the same time. Thus, we can smartly choose and replicate only those processes for which the lightweight data-analytic detectors would perform poorly. In addition, we propose a new evaluation method based on the probability that a corruption will pass unnoticed by a particular detector (instead of just reporting overall single-bit precision and recall). In our experiments, we use four applications dealing with different explosions. Our results indicate that our new approach can protect the MPI applications analyzed with 7-70 percent less overhead (depending on the application) than that of full duplication with similar detection recall.

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

11 April 2018 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
LYLi Yu
Li Yu
ZZZhou Zhou
Zhou Zhou
YFYuping Fan
Yuping Fan
MPMichael E. Papka
Michael E. Papka
ZLZhiling Lan
Zhiling Lan