Kun He

Kun He

Auto-generated profile, based on publicly available information

Kun He

Huazhong University of Science and Technology

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
25 November 2022 in Knowledge-Based Systems
Verified
Journal Article
Closed access
JZJiongzhi Zheng
Jiongzhi Zheng
KHKun He
Kun He
JZJianrong Zhou
Jianrong Zhou
YJYan Jin
Yan Jin
CLChu-Min Li
Chu-Min Li

3 November 2022
Verified
Book Chapter
Closed access
PDF file
XWXiaosen Wang
Xiaosen Wang
ZZZeliang Zhang
Zeliang Zhang
KTKangheng Tong
Kangheng Tong
DGDihong Gong
Dihong Gong
KHKun He
Kun He
WLWei Liu
Wei Liu

28 June 2018 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
KHKun He
Kun He
XMXiaozhu Meng
Xiaozhu Meng
ZPZhizhou Pan
Zhizhou Pan
LYLing Yuan
Ling Yuan
PZPan Zhou
Pan Zhou
As a crucial task in heterogeneous distributed systems, DAG-scheduling models a scheduling application with a set of distributed tasks by a Direct Acyclic Graph (DAG). The goal is to assign tasks to different processors so that the whole application can finish as soon as possible. Task Duplication-Based (TDB) scheme is an important technique addressing this problem. The main idea is to duplicate tasks on multiple machines so that the results of the duplicated tasks are available on multiple machines to trade computation time for communication time. Existing TDB algorithms enumerate and test all possible duplication candidates, and only keep the candidates that can improve the overall scheduling. We observe that while a duplication candidate is ineffective at the moment, after other duplications have been applied, this ineffective duplication candidate can become effective, which in turn can cause other ineffective duplications to become effective. We call this phenomenon the chain reaction of task duplication. We propose a novel Task Duplication based Clustering Algorithm (TDCA) to improve the schedule performance by utilizing duplication task more thoroughly. TDCA improves parameter calculation, task duplication, and task merging. The analysis and experiments are based on randomly generated graphs with various characteristics, including DAG depth and width, communication-computing cost ration, and variant computation power of processors. Our results demonstrate that the TDCA algorithm is very competitive. It improves the schedule makespan of task duplication-based algorithms for heterogeneous systems for various communication-computing cost ratios.

23 April 2023 in Computers & Operations Research
Verified
Journal Article
Closed access
JZJiongzhi Zheng
Jiongzhi Zheng
JZJialun Zhong
Jialun Zhong
MCMenglei Chen
Menglei Chen
KHKun He
Kun He

12 April 2022 in Computers & Operations Research
Verified
Journal Article
Closed access
YYYong Yuan
Yong Yuan
KTKevin Tole
Kevin Tole
FNFei Ni
Fei Ni
KHKun He
Kun He
ZXZhengda Xiong
Zhengda Xiong
JLJinfa Liu
Jinfa Liu

29 April 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
JCJinsong Chen
Jinsong Chen
BLBoyu Li
Boyu Li
KHKun He
Kun He