Qiao Kang

Qiao Kang

Auto-generated profile, based on publicly available information

Qiao Kang

Department of Electrical and Computer Engineering, Northwestern University, Evanston, IL, U.S.A., --- Select a Country --

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
5 June 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
QKQiao Kang
Qiao Kang
SLSunwoo Lee
Sunwoo Lee
KHKaiyuan Hou
Kaiyuan Hou
RRRobert Ross
Robert Ross
AAAnkit Agrawal
Ankit Agrawal
WLWei-Keng Liao
Wei-Keng Liao
Two-phase I/O is a well-known strategy for implementing collective MPI-IO functions. It redistributes I/O requests among the calling processes into a form that minimizes the file access costs. As modern parallel computers continue to grow into the exascale era, the communication cost of such request redistribution can quickly overwhelm collective I/O performance. This effect has been observed from parallel jobs that run on multiple compute nodes with a high count of MPI processes on each node. To reduce the communication cost, we present a new design for collective I/O by adding an extra communication layer that performs request aggregation among processes within the same compute nodes. This approach can significantly reduce inter-node communication contention when redistributing the I/O requests. We evaluate the performance and compare it with the original two-phase I/O on Cray XC40 parallel computers (Theta and Cori) with Intel KNL and Haswell processors. Using I/O patterns from two large-scale production applications and an I/O benchmark, we show our proposed method effectively reduces the communication cost and hence maintains the scalability for a large number of processes.

1 January 2021
Verified
Conference Paper
Open access
RAReda Al-Bahrani
Reda Al-Bahrani
DJDipendra Jha
Dipendra Jha
QKQiao Kang
Qiao Kang
SLSunwoo Lee
Sunwoo Lee
ZYZijiang Yang
Zijiang Yang
ACAlok Choudhary
Alok Choudhary

1 November 2017
Verified
Conference Paper
Closed access
QKQiao Kang
Qiao Kang
WLWei-Keng Liao
Wei-Keng Liao
AAAnkit Agrawal
Ankit Agrawal
ACAlok Choudhary
Alok Choudhary
Recurrent neural network has been widely used as auto-regressive model for time series. The most commonly used training method for recurrent neural network is back propagation. However, recurrent neural networks trained with back propagation can get trapped at local minima and saddle points. In these cases, auto-regressive models cannot effectively model time series patterns. In order to address these problems, we propose a hybrid recurrent neural network training algorithm that consists of two phases: exploration and exploitation. Exploration phase uses synchronous particle swarm optimization to search for parameter settings with high activation score and low error. The results of exploration phase are trained with proposed enhanced back propagation, an improved algorithm over traditional back propagation that aggregates temporal errors across timestamps, in exploitation phase. We evaluate our proposed methods using four real-world datasets. Our proposed algorithm, applied to both regularized and adaptive momentum back propagation, increases convergence speed by 10% to 20% and reduces testing mean square error(MSE) at convergence by 5% to 30%. Using particle swarm optimization and activation list in exploration phase, the hybrid training algorithm reduces testing MSEs by more than 30% at convergence compared with traditional back propagation.

1 January 2015
Verified
Book Chapter
Closed access
PDF file
JZJian Zhang
Jian Zhang
QKQiao Kang
Qiao Kang
ZYZhoujian Yu
Zhoujian Yu
LWLei Wang
Lei Wang
CYCangzhou Yuan
Cangzhou Yuan