Jinsung Kim

Dr. Jinsung Kim

Computer Science and Engineering, Chung-Ang University, Seoul, Republic of Korea
orcid

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
11 June 2018
Verified
Conference Paper
Open access
PDF file
CHChangwan Hong
Changwan Hong
ASAravind Sukumaran-Rajam
Aravind Sukumaran-Rajam
BBBortik Bandyopadhyay
Bortik Bandyopadhyay
JKJinsung Kim
Jinsung Kim
SKSüreyya Emre Kurt
Süreyya Emre Kurt
PSP. Sadayappan
P. Sadayappan
Sparse Matrix-Vector (SpMV) and Sparse Matrix-Multivector (SpMM) products are key kernels for computational science and data science. While GPUs offer significantly higher peak performance and memory bandwidth than multicore CPUs, achieving high performance on sparse computations on GPUs is very challenging. A tremendous amount of recent research has focused on various GPU implementations of the SpMV kernel. But the multi-vector SpMM kernel has received much less attention. In this paper, we present an in-depth analysis to contrast SpMV and SpMM, and develop a new sparse-matrix representation and computation approach suited to achieving high data-movement efficiency and effective GPU parallelization of SpMM. Experimental evaluation using the entire SuiteSparse matrix suite demonstrates significant performance improvement over existing SpMM implementations from vendor libraries.

1 February 2019
Verified
Conference Paper
Closed access
JKJinsung Kim
Jinsung Kim
ASAravind Sukumaran-Rajam
Aravind Sukumaran-Rajam
VTVineeth Thumma
Vineeth Thumma
SKSriram Krishnamoorthy
Sriram Krishnamoorthy
APAjay Panyala
Ajay Panyala
PSP. Sadayappan
P. Sadayappan
Tensor contractions are higher dimensional generalizations of matrix-matrix multiplication. They form the compute-intensive core of many applications in computational science and data science. In this paper, we describe a high-performance GPU code generator for arbitrary tensor contractions. It exploits domain-specific properties about data reuse in tensor contractions to devise an effective code generation schema, coupled with an effective model-driven search, to determine parameters for mapping of computation to threads and staging of data through the GPU memory hierarchy. Experimental evaluation using a set of tensor contraction benchmarks demonstrates performance improvement and/or significantly reduced code generation time over other state-of-the-art tensor contraction libraries and code generators.

10 July 2023 in The Journal of Chemical Physics
Verified
Journal Article
Open access
PDF file
EMErdal Mutlu
Erdal Mutlu
APAjay Panyala
Ajay Panyala
NGNitin Gawande
Nitin Gawande
ABAbhishek Bagusetty
Abhishek Bagusetty
JGJeffrey Glabe
Jeffrey Glabe
SKSriram Krishnamoorthy
Sriram Krishnamoorthy
Tensor algebra operations such as contractions in computational chemistry consume a significant fraction of the computing time on large-scale computing platforms. The widespread use of tensor contractions between large multi-dimensional tensors in describing electronic structure theory has motivated the development of multiple tensor algebra frameworks targeting heterogeneous computing platforms. In this paper, we present Tensor Algebra for Many-body Methods (TAMM), a framework for productive and performance-portable development of scalable computational chemistry methods. TAMM decouples the specification of the computation from the execution of these operations on available high-performance computing systems. With this design choice, the scientific application developers (domain scientists) can focus on the algorithmic requirements using the tensor algebra interface provided by TAMM, whereas high-performance computing developers can direct their attention to various optimizations on the underlying constructs, such as efficient data distribution, optimized scheduling algorithms, and efficient use of intra-node resources (e.g., graphics processing units). The modular structure of TAMM allows it to support different hardware architectures and incorporate new algorithmic advances. We describe the TAMM framework and our approach to the sustainable development of scalable ground- and excited-state electronic structure methods. We present case studies highlighting the ease of use, including the performance and productivity gains compared to other frameworks.

17 March 2016
Verified
Conference Paper
Open access
SRSamyam Rajbhandari
Samyam Rajbhandari
JKJinsung Kim
Jinsung Kim
SKSriram Krishnamoorthy
Sriram Krishnamoorthy
LPLouis-Noël Pouchet
Louis-Noël Pouchet
FRFabrice Rastello
Fabrice Rastello
PSP. Sadayappan
P. Sadayappan
Loop fusion is a key program transformation for data locality optimization that is implemented in production compilers. But optimizing compilers for imperative languages currently cannot ex- ploit fusion opportunities across a set of recursive tree traversal computations with producer-consumer relationships. In this paper, we develop a compile-time approach to dependence characterization and program transformation to enable fusion across recursively specified traversals over k-d trees. We present the FuseT source-to- source code transformation framework to automatically generate fused composite recursive operators from an input program containing a sequence of primitive recursive operators. We use our framework to implement fused operators for MADNESS, Multi-resolution Adaptive Numerical Environment for Scientific Simulation. We show that locality optimization through fusion can offer significant performance improvement.

12 June 2018
Verified
Conference Paper
Open access
JKJinsung Kim
Jinsung Kim
ASAravind Sukumaran-Rajam
Aravind Sukumaran-Rajam
CHChangwan Hong
Changwan Hong
APAjay Panyala
Ajay Panyala
RSRohit Kumar Srivastava
Rohit Kumar Srivastava
PSP. Sadayappan
P. Sadayappan

9 November 2011 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
SPSang Oh Park
Sang Oh Park
JKJinsung Kim
Jinsung Kim
SKSung Jo Kim
Sung Jo Kim