Lishan Yang

Lishan Yang

Auto-generated profile, based on publicly available information

Lishan Yang

Department of Computer ScienceGeorge Mason University

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
13 March 2020 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
LYLishan Yang
Lishan Yang
BNBin Nie
Bin Nie
AJAdwait Jog
Adwait Jog
ESEvgenia Smirni
Evgenia Smirni
Graphics Processing Units (GPUs) have rapidly evolved to enable energy-efficient data-parallel computing for a broad range of scientific areas. While GPUs achieve exascale performance at a stringent power budget, they are also susceptible to soft errors, often caused by high-energy particle strikes, that can significantly affect the application output quality. Understanding the resilience of general purpose GPU (GPGPU) applications is especially challenging because unlike CPU applications, which are mostly single-threaded, GPGPU applications can contain hundreds to thousands of threads, resulting in a tremendously large fault site space in the order of billions, even for some simple applications and even when considering the occurrence of just a single-bit fault. We present a systematic way to progressively prune the fault site space aiming to dramatically reduce the number of fault injections such that assessment for GPGPU application error resilience becomes practical. The key insight behind our proposed methodology stems from the fact that while GPGPU applications spawn a lot of threads, many of them execute the same set of instructions. Therefore, several fault sites are redundant and can be pruned by careful analysis. We identify important features across a set of 10 applications (16 kernels) from Rodinia and Polybench suites and conclude that threads can be primarily classified based on the number of the dynamic instructions they execute. We therefore achieve significant fault site reduction by analyzing only a small subset of threads that are representative of the dynamic instruction behavior (and therefore error resilience behavior) of the GPGPU applications. Further pruning is achieved by identifying the dynamic instruction commonalities (and differences) across code blocks within this representative set of threads, a subset of loop iterations within the representative threads, and a subset of destination register bit positions. The above steps result in a tremendous reduction of fault sites by up to seven orders of magnitude. Yet, this reduced fault site space accurately captures the error resilience profile of GPGPU applications. We show the effectiveness of the proposed progressive pruning technique for a single-bit model and illustrate its application to even more challenging cases with three distinct multi-bit fault models.

30 November 2021 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
RPRiccardo Pinciroli
Riccardo Pinciroli
LYLishan Yang
Lishan Yang
JAJacob Alter
Jacob Alter
ESEvgenia Smirni
Evgenia Smirni
Data center downtime typically centers around IT equipment failure. Storage devices are the most frequently failing components in data centers. We present a comparative study of hard disk drives (HDDs) and solid state drives (SSDs) that constitute the typical storage in data centers. Using six-year field data of 100,000 HDDs of different models from the same manufacturer from the Backblaze dataset and six-year field data of 30,000 SSDs of three models from a Google data center, we characterize the workload conditions that lead to failures. We illustrate that their root failure causes differ from common expectations and that they remain difficult to discern. For the case of HDDs we observe that young and old drives do not present many differences in their failures. Instead, failures may be distinguished by discriminating drives based on the time spent for head positioning. For SSDs, we observe high levels of infant mortality and characterize the differences between infant and non-infant failures. We develop several machine learning failure prediction models that are shown to be surprisingly accurate, achieving high recall and low false-positive rates. These models are used beyond simple prediction as they aid us to untangle the complex interaction of workload characteristics that lead to failures and identify failure root causes from monitored symptoms.

15 November 2025
Verified
Conference Paper
Open access
YSYu Sun
Yu Sun
ZCZachary Coalson
Zachary Coalson
SCShiyang Chen
Shiyang Chen
HLHang Liu
Hang Liu
ZZZhao Zhang
Zhao Zhang
LYLishan Yang
Lishan Yang


9 September 2024
Verified
Book Chapter
Closed access
PDF file
ASAnna Schmedding
Anna Schmedding
PSPhilip Schowitz
Philip Schowitz
XZXugui Zhou
Xugui Zhou
YLYiyang Lu
Yiyang Lu
LYLishan Yang
Lishan Yang
ESEvgenia Smirni
Evgenia Smirni

24 February 2023 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
ASAnna Schmedding
Anna Schmedding
RPRiccardo Pinciroli
Riccardo Pinciroli
LYLishan Yang
Lishan Yang
ESEvgenia Smirni
Evgenia Smirni
We present an individual-centric model for COVID-19 spread in an urban setting. We first analyze patient and route data of infected patients from January 20, 2020, to May 31, 2020, collected by the Korean Center for Disease Control & Prevention (KCDC) and discover how infection clusters develop as a function of time. This analysis offers a statistical characterization of mobility habits and patterns of individuals at the beginning of the pandemic. While the KCDC data offer a wealth of information, they are also by their nature limited. To compensate for their limitations, we use detailed mobility data from Berlin, Germany after observing that mobility of individuals is surprisingly similar in both Berlin and Seoul. Using information from the Berlin mobility data, we cross-fertilize the KCDC Seoul data set and use it to parameterize an agent-based simulation that models the spread of the disease in an urban environment. After validating the simulation predictions with ground truth infection spread in Seoul, we study the importance of each input parameter on the prediction accuracy, compare the performance of our model to state-of-the-art approaches, and show how to use the proposed model to evaluate different what-if counter-measure scenarios.