Chansup Byun

Chansup Byun

Auto-generated profile, based on publicly available information

Chansup Byun

SuperComputing Center, MIT Lincoln Laboratory, USA

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

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

Representative Publications

View All Publications
1 March 1998 in Journal of Aircraft
Verified
Journal Article
Closed access
CBChansup Byun
Chansup Byun
GGGuru P. Guruswamy
Guru P. Guruswamy

20 September 2021
Verified
Conference Paper
Open access
BBBill Bergeron
Bill Bergeron
MHMatthew Hubbell
Matthew Hubbell
DSDylan Sequeira
Dylan Sequeira
WWWinter Williams
Winter Williams
WAWilliam Arcand
William Arcand
JKJeremy Kepner
Jeremy Kepner
Supercomputers are complex systems producing vast quantities of performance data from multiple sources and of varying types. Performance data from each of the thousands of nodes in a supercomputer tracks multiple forms of storage, memory, networks, processors, and accelerators. Optimization of application performance is critical for cost effective usage of a supercomputer and requires efficient methods for effectively viewing performance data. The combination of supercomputing analytics and 3D gaming visualization enables real-time processing and visual data display of massive amounts of information that humans can process quickly with little training. Our system fully utilizes the capabilities of modern 3D gaming environments to create novel representations of computing hardware which intuitively represent the physical attributes of the supercomputer while displaying real-time alerts and component utilization. This system allows operators to quickly assess how the supercomputer is being used, gives users visibility into the resources they are consuming, and provides instructors new ways to interactively teach the computing architecture concepts necessary for efficient computing.

22 September 2020
Verified
Conference Paper
Open access
SSSiddharth Samsi
Siddharth Samsi
APAndrew Prout
Andrew Prout
MJMichael Jones
Michael Jones
AKAndrew Kirby
Andrew Kirby
BABill Arcand
Bill Arcand
JKJeremy Kepner
Jeremy Kepner
Artificial Intelligence/Machine Learning applications require the training of complex models on large amounts of labelled data. The large computational requirements for training deep models have necessitated the development of new methods for faster training. One such approach is the data parallel approach, where the training data is distributed across multiple compute nodes. This approach is simple to implement and supported by most of the commonly used machine learning frameworks. The data parallel approach leverages MPI for communicating gradients across all nodes. In this paper, we examine the effects of using different physical hardware interconnects and network-related software primitives for enabling data distributed deep learning. We compare the effect of using GPUDirect and NCCL on Ethernet and OmniPath fabrics. Our results show that using Ethernet-based networking in shared HPC systems does not have a significant effect on the training times for commonly used deep neural network architectures or traditional HPC applications such as Computational Fluid Dynamics.

1 September 2019
Verified
Conference Paper
Open access
APAndrew Prout
Andrew Prout
AKAnna Klein
Anna Klein
PMPeter Michaleas
Peter Michaleas
LMLauren Milechin
Lauren Milechin
JMJulie Mullen
Julie Mullen
MJMichael Jones
Michael Jones

17 July 2024
Verified
Conference Paper
Open access
CBChansup Byun
Chansup Byun
JMJulia Mullen
Julia Mullen
ARAlbert Iwersen Reuther
Albert Iwersen Reuther
WAWilliam Arcand
William Arcand
WBWilliam Bergeron
William Bergeron
LMLauren Milechin
Lauren Milechin
One of the more complex tasks for researchers using HPC systems is performance monitoring and tuning of their applications. Developing a practice of continuous performance improvement, both for speed-up and efficient use of resources is essential to the long term success of both the HPC practitioner and the research project. Profiling tools provide a nice view of the performance of an application but often have a steep learning curve and rarely provide an easy to interpret view of resource utilization. Lower level tools such as top and htop provide a view of resource utilization for those familiar and comfortable with Linux but a barrier for newer HPC practitioners. To expand the existing profiling and job monitoring options, the MIT Lincoln Laboratory Supercomputing Center created LLoad, a tool that captures a snapshot of the resources being used by a job on a per user basis. LLload is a tool built from standard HPC tools that provides an easy way for a researcher to track resource usage of active jobs. We explain how the tool was designed and implemented and provide insight into how it is used to aid new researchers in developing their performance monitoring skills as well as guide researchers in their resource requests.

13 September 2022 in arXiv
Verified
Preprint
Open access
PDF file
TTTyler Trigg
Tyler Trigg
CMChad Meiners
Chad Meiners
SPSandeep Pisharody
Sandeep Pisharody
HJHayden Jananthan
Hayden Jananthan
MJMichael Jones
Michael Jones
JKJeremy Kepner
Jeremy Kepner
Internet analysis is a major challenge due to the volume and rate of network traffic. In lieu of analyzing traffic as raw packets, network analysts often rely on compressed network flows (netflows) that contain the start time, stop time, source, destination, and number of packets in each direction. However, many traffic analyses benefit from temporal aggregation of multiple simultaneous netflows, which can be computationally challenging. To alleviate this concern, a novel netflow compression and resampling method has been developed leveraging GraphBLAS hyperspace traffic matrices that preserve anonymization while enabling subrange analysis. Standard multitemporal spatial analyses are then performed on each subrange to generate detailed statistical aggregates of the source packets, source fan-out, unique links, destination fan-in, and destination packets of each subrange which can then be used for background modeling and anomaly detection. A simple file format based on GraphBLAS sparse matrices is developed for storing these statistical aggregates. This method is scale tested on the MIT SuperCloud using a 50 trillion packet netflow corpus from several hundred sites collected over several months. The resulting compression achieved is significant (<0.1 bit per packet) enabling extremely large netflow analyses to be stored and transported. The single node parallel performance is analyzed in terms of both processors and threads showing that a single node can perform hundreds of simultaneous analyses at over a million packets/sec (roughly equivalent to a 10 Gigabit link).