I-Hsin Chung

I-Hsin Chung

Auto-generated profile, based on publicly available information

I-Hsin Chung

IBM Research, Yorktown Heights, NY, USA

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
8 November 2016 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
ICI-Hsin Chung
I-Hsin Chung
TSTara N. Sainath
Tara N. Sainath
BRBhuvana Ramabhadran
Bhuvana Ramabhadran
MPMichael Picheny
Michael Picheny
JGJohn Gunnels
John Gunnels
BKBrian Kingsbury
Brian Kingsbury
Deep Neural Networks (DNNs) have recently been shown to significantly outperform existing machine learning techniques in several pattern recognition tasks. DNNs are the state-of-the-art models used in image recognition, object detection, classification and tracking, and speech and language processing applications. The biggest drawback to DNNs has been the enormous cost in computation and time taken to train the parameters of the networks - often a tenfold increase relative to conventional technologies. Such training time costs can be mitigated by the application of parallel computing algorithms and architectures. However, these algorithms often run into difficulties because of the cost of inter-processor communication bottlenecks. In this paper, we describe how to enable Parallel Deep Neural Network Training on the IBM Blue Gene/Q (BG/Q) computer system. Specifically, we explore DNN training using the data-parallel Hessian-free 2nd order optimization algorithm. Such an algorithm is particularly well-suited to parallelization across a large set of loosely coupled processors. BG/Q, with its excellent inter-processor communication characteristics, is an ideal match for this type of algorithm. The paper discusses how issues regarding programming model and data-dependent imbalances are addressed. Results on large-scale speech tasks show that the performance on BG/Q scales linearly up to 4096 processes with no loss in accuracy. This allows us to train neural networks using billions of training examples in a few hours.

1 January 2007
Verified
Conference Paper
Closed access
HYHao Yu
Hao Yu
JMJose E. Moreira
Jose E. Moreira
PDParijat Dube
Parijat Dube
ICI-Hsin Chung
I-Hsin Chung
LZLi Zhang
Li Zhang
Scale-out approach, in contrast to scale-up approach (exploring increasing performance by utilizing more powerful shared-memory servers), refers to deployment of applications on a large number of small, inexpensive, but tightly packaged and tightly interconnected servers. Recently, there has been an increasing interest in scale-out approach. The purpose of this study is to discover advantages or disadvantages of scale-out systems with a typical enterprise workload, IBM Trade Performance Benchmark Sample for Websphere application server (a.k.a. Trade6). In this work, through cross system performance comparison, we show that for such workload, scale-out approach has better performance/cost effect. In term of scalability, we show that Websphere application server packages for distributed environment scale well while the possible bottleneck of the application deployment is the database tier. We present preliminary results to show that both database partitioning feature (DPF) and federated database server approaches are not exactly suitable for providing scale-out solution for the database tier of workloads similar to Trade (small tables and short transactions). In addition, we discuss our on-going effort on further performance study: (1) studies of performance/scalability for larger deployments by adopting the IBM AMBIENCE queuing network modeling tool, (2) performance breakdowns utilizing IBM ACTC hardware counter library.

1 January 2018
Verified
Book Chapter
Closed access
PDF file
CPCarl Pearson
Carl Pearson
ICI-Hsin Chung
I-Hsin Chung
ZSZehra Sura
Zehra Sura
WHWen-Mei Hwu
Wen-Mei Hwu
JXJinjun Xiong
Jinjun Xiong

1 September 2020
Verified
Conference Paper
Closed access
CCChan Jung Chang
Chan Jung Chang
JCJerry Chou
Jerry Chou
YCYu-Ching Chou
Yu-Ching Chou
ICI-Hsin Chung
I-Hsin Chung
As data volume keeps increasing at a rapid rate, there is an urgent need for large, reliable, and cost-effective storage systems. Erasure coding has drawn increasing attention because of its ability to ensure data reliability with higher storage efficiency, and it has been widely adopted in many distributed and large-scale storage systems, such as Azure cloud storage and HDFS. However, the storage efficiency of erasure code comes at the price of higher computing complexity. While many studies have shown the coding computations can be significantly accelerated using GPU, the overhead of data transfer between storage devices and GPUs become a new performance bottleneck. In this work, we designed and implemented, ECS2, a fast erasure coding library on GPU -accelerated storage to let users enhance their data protection with transparent IO performance and file system like programming interface. By taking advantage of the latest GPUDirect technology supported on Nvidia GPU, our library is able to bypass CPU and host memory copy from the IO path, so that both the computing and IO overhead from coding can be minimized. Using synthetic IO workload based on real storage system trace, we show that the IO latency can be reduced by 10% ∼ 20% with GPUDirect technology, and the overall IO throughput of a storage system can be improved up to 70%.

21 June 2021
Verified
Conference Paper
Open access
CPCarl Pearson
Carl Pearson
KWKun Wu
Kun Wu
ICI-Hsin Chung
I-Hsin Chung
JXJinjun Xiong
Jinjun Xiong
WHWen-Mei Hwu
Wen-Mei Hwu
MPI derived datatypes are an abstraction that simplifies handling of non-contiguous data in MPI applications. These datatypes are recursively constructed at runtime from primitive Named Types defined in the MPI standard. More recently, the development and deployment of CUDA-aware MPI implementations has encouraged the transition of distributed high-performance MPI codes to use GPUs. Such implementations allow MPI functions to directly operate on GPU buffers, easing integration of GPU compute into MPI codes. This work first presents a novel datatype handling strategy for nested strided datatypes, which finds a middle ground between the specialized or generic handling in prior work. This work also shows that the performance characteristics of non-contiguous data handling can be modeled with empirical system measurements, and used to transparently improve MPI_Send/Recv latency. Finally, despite substantial attention to non-contiguous GPU data and CUDA-aware MPI implementations, good performance cannot be taken for granted. This work demonstrates its contributions through an MPI interposer library, TEMPI. TEMPI can be used with existing MPI deployments without system or application changes. Ultimately, the interposed-library model of this work demonstrates MPI_Pack speedup of up to 242000x and MPI_Send speedup of up to 59000x compared to the MPI implementation deployed on a leadership-class supercomputer. This yields speedup of more than 917x in a 3D halo exchange with 3072 processes.

30 March 2025
Verified
Conference Paper
Open access
AMApoorve Mohan
Apoorve Mohan
RWRobert Walkup
Robert Walkup
BKBengi Karacali
Bengi Karacali
MCMing-Hung Chen
Ming-Hung Chen
AKAbdullah Kayi
Abdullah Kayi
SSSeetharami Seelam
Seetharami Seelam