Geonhwa Jeong

Geonhwa Jeong

Auto-generated profile, based on publicly available information

Geonhwa Jeong

Georgia Institute of Technology, Atlanta, GA, United States

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
23 June 2024
Verified
Conference Paper
Open access
ARAkshat Ramachandran
Akshat Ramachandran
ZWZishen Wan
Zishen Wan
GJGeonhwa Jeong
Geonhwa Jeong
JGJohn Gustafson
John Gustafson
TKTushar Krishna
Tushar Krishna
Traditional Deep Neural Network (DNN) quantization methods using integer or floating-point data types struggle to capture diverse DNN parameter distributions and often require large silicon overhead and intensive quantization-aware training. In this study, we introduce Logarithmic Posits (LP), an adaptive, hardware-friendly data type inspired by posits that dynamically adapts to DNN weight/activation distributions by parameterizing LP bit fields. We also develop a novel genetic-algorithm based framework, LP Quantization (LPQ), to find optimal layer-wise LP parameters while reducing representational divergence between quantized and full-precision models through a novel global-local contrastive objective. Additionally, we design a LP accelerator (LPA) architecture comprising of mixed-precision LP processing elements (PEs). Our algorithmhardware co-design demonstrates on average <1% drop in top-1 accuracy across various CNN and ViT models. It also achieves ~ 2× improvements in performance per unit area and 2.2× gains in energy efficiency compared to state-of-the-art quantization accelerators using different data types.

11 August 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
Gordon Euhyun MoonGordon Euhyun Moon
Gordon Euhyun Moon
HKHyoukjun Kwon
Hyoukjun Kwon
GJGeonhwa Jeong
Geonhwa Jeong
PCPrasanth Chatarasi
Prasanth Chatarasi
SRSivasankaran Rajamanickam
Sivasankaran Rajamanickam
TKTushar Krishna
Tushar Krishna
There is a growing interest in custom spatial accelerators for machine learning applications. These accelerators employ a spatial array of processing elements (PEs) interacting via custom buffer hierarchies and networks-on-chip. The efficiency of these accelerators comes from employing optimized dataflow (i.e., spatial/temporal partitioning of data across the PEs and fine-grained scheduling) strategies to optimize data reuse. The focus of this work is to evaluate these accelerator architectures using a tiled general matrix-matrix multiplication (GEMM) kernel. To do so, we develop a framework that finds optimized mappings (dataflow and tile sizes) for a tiled GEMM for a given spatial accelerator and workload combination, leveraging an analytical cost model for runtime and energy. Our evaluations over five spatial accelerators demonstrate that the tiled GEMM mappings systematically generated by our framework achieve high performance on various GEMM workloads and accelerators.