Erlin Yao

Erlin Yao


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
10 October 2018 in Protein & Cell
Verified
Journal Article
Open access
PDF file
XZXiaoya Zhang
Xiaoya Zhang
XPXiaohong Peng
Xiaohong Peng
CHChengsheng Han
Chengsheng Han
WZWenzhen Zhu
Wenzhen Zhu
LWLisi Wei
Lisi Wei
LCLiangyi Chen
Liangyi Chen
A unified deep-learning network to accurately segment insulin granules of different animal models imaged under different electron microscopy methodologies

1 May 2012
Verified
Conference Paper
Closed access
EYErlin Yao
Erlin Yao
RWRui Wang
Rui Wang
MCMingyu Chen
Mingyu Chen
GTGuangming Tan
Guangming Tan
NSNinghui Sun
Ninghui Sun
Fault tolerance overhead of high performance computing (HPC) applications is becoming critical to the efficient utilization of HPC systems at large scale. Today's HPC applications typically tolerate fail-stop failures by check pointing. However, check pointing will lose its efficiency when system becoming very large. An alternative method is algorithm-based fault recovery which has been proved to be more efficient than check pointing. In this paper, we first point out by theoretical analysis that algorithm-based fault recovery will also lose its efficiency when systems scale up to Exa flops. Then, a more efficient algorithm-based fault tolerance scheme for HPC applications at large scale is presented. The new method has two novel skills. One is algorithm-based hot replacement, which avoids the stop-and-wait time after failure. Second is background accelerated recovery, which guarantees the system to endure multiple failures in succession. As a case study, this method is incorporated to High Performance Lin pack (HPL). Theoretical analysis shows that the fault tolerance overhead can be reduced to 2/log(p, 2) of that of algorithm-based fault recovery method (p is the number of computation processes), so that the new method will still be efficient in Exascale. Experimental results for up to 1800 processes show that the overhead of the new method is about 25% of that of algorithm-based fault recovery method, which is close to the theoretical prediction.

3 February 2022 in CCF Transactions on High Performance Computing
Verified
Journal Article
Closed access
PDF file
PLPei Liu
Pei Liu
EYErlin Yao
Erlin Yao
TLTao Liu
Tao Liu
LKLei Kong
Lei Kong
Xiao TangXiao Tang
Xiao Tang
GTGuangming Tan
Guangming Tan

1 January 2018 in Computer Systems Science and Engineering
Verified
Journal Article
Open access
LYLufeng Yuan
Lufeng Yuan
EYErlin Yao
Erlin Yao
GTGuangming Tan
Guangming Tan
This paper proposes a machine learning based method which can detect certain events automatically and precisely in biomedical imaging. We detect one important and not well-defined event, which is called flash, in fluorescence images of Escherichia coli. Given a time series of images, first we propose a scheme to transform the event detection on region of interest (ROI) in images to a classification problem. Then with supervised human labeling data, we develop a feature selection technique to utilize support vector machine (SVM) to solve this classification problem. To reduce the time in training SVM model, a parallel version of SVM training is implemented. On ten stacks of fluorescence images labeled by experts, each of which owns one hundred 512 ·512 images with in total 4906 ROIs and 72056 labeled events, event detection with proposed method takes 19 seconds, while human labeling roughly costs 60 hours. With human labeling as the standard, the accuracy of our method achieves an F-value of about 0.81. This method is much faster than human detection and expects to be more precise with bigger data. It also can be expanded to a series of event detection with similar properties and improve efficiency of detection greatly.

27 September 2026
Verified
Conference Paper
Open access
YLYao Liu
Yao Liu
YLYewen Li
Yewen Li
ZZZhonghai Zhang
Zhonghai Zhang
EYErlin Yao
Erlin Yao
GTGuangming Tan
Guangming Tan
WJWeile Jia
Weile Jia

21 June 2011 in arXiv
Verified
Preprint
Open access
PDF file
EYErlin Yao
Erlin Yao
MCMingyu Chen
Mingyu Chen
RWRui Wang
Rui Wang
WZWenli Zhang
Wenli Zhang
GTGuangming Tan
Guangming Tan
Fault tolerance overhead of high performance computing (HPC) applications is becoming critical to the efficient utilization of HPC systems at large scale. HPC applications typically tolerate fail-stop failures by checkpointing. Another promising method is in the algorithm level, called algorithmic recovery. These two methods can achieve high efficiency when the system scale is not very large, but will both lose their effectiveness when systems approach the scale of Exaflops, where the number of processors including in system is expected to achieve one million. This paper develops a new and efficient algorithm-based fault tolerance scheme for HPC applications. When failure occurs during the execution, we do not stop to wait for the recovery of corrupted data, but replace them with the corresponding redundant data and continue the execution. A background accelerated recovery method is also proposed to rebuild redundancy to tolerate multiple times of failures during the execution. To demonstrate the feasibility of our new scheme, we have incorporated it to the High Performance Linpack. Theoretical analysis demonstrates that our new fault tolerance scheme can still be effective even when the system scale achieves the Exaflops. Experiment using SiCortex SC5832 verifies the feasibility of the scheme, and indicates that the advantage of our scheme can be observable even in a small scale.