Gilbert Jonatan

Gilbert Jonatan

Auto-generated profile, based on publicly available information

Gilbert Jonatan

KAIST, Daejeon, Republic of Korea

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
28 October 2023
Verified
Conference Paper
Open access
KSKaustubh Shivdikar
Kaustubh Shivdikar
YBYuhui Bao
Yuhui Bao
RARashmi Agrawal
Rashmi Agrawal
MSMichael Shen
Michael Shen
GJGilbert Jonatan
Gilbert Jonatan
David KaeliDavid Kaeli
David Kaeli
Fully Homomorphic Encryption (FHE) enables the processing of encrypted data without decrypting it. FHE has garnered significant attention over the past decade as it supports secure outsourcing of data processing to remote cloud services. Despite its promise of strong data privacy and security guarantees, FHE introduces a slowdown of up to five orders of magnitude as compared to the same computation using plaintext data. This overhead is presently a major barrier to the commercial adoption of FHE. In this work, we leverage GPUs to accelerate FHE, capitalizing on a well-established GPU ecosystem available in the cloud. We propose GME, which combines three key microarchitectural extensions along with a compile-time optimization to the current AMD CDNA GPU architecture. First, GME integrates a lightweight on-chip compute unit (CU)-side hierarchical interconnect to retain ciphertext in cache across FHE kernels, thus eliminating redundant memory transactions. Second, to tackle compute bottlenecks, GME introduces special MOD-units that provide native custom hardware support for modular reduction operations, one of the most commonly executed sets of operations in FHE. Third, by integrating the MOD-unit with our novel pipelined 64-bit integer arithmetic cores (WMAC-units), GME further accelerates FHE workloads by . Finally, we propose a Locality-Aware Block Scheduler (LABS) that exploits the temporal locality available in FHE primitive blocks. Incorporating these microarchitectural features and compiler optimizations, we create a synergistic approach achieving average speedups of 796 ×, 14.2 ×, and 2.3 × over Intel Xeon CPU, NVIDIA V100 GPU, and Xilinx FPGA implementations, respectively.

16 February 2024 in Proceedings of the ACM on Measurement and Analysis of Computing Systems
Verified
Journal Article
Open access
GJGilbert Jonatan
Gilbert Jonatan
HCHaeyoon Cho
Haeyoon Cho
HSHyojun Son
Hyojun Son
XWXiangyu Wu
Xiangyu Wu
NLNeal Livesay
Neal Livesay
JKJohn Kim
John Kim
Processing-in-memory (PIM), where the compute is moved closer to the memory or the data, has been widely explored to accelerate emerging workloads. Recently, different PIM-based systems have been announced by memory vendors to minimize data movement and improve performance as well as energy efficiency. One critical component of PIM is the large amount of compute parallelism provided across many PIM "nodes'' or the compute units near the memory. In this work, we provide an extensive evaluation and analysis of real PIM systems based on UPMEM PIM. We show that while there are benefits of PIM, there are also scalability challenges and limitations as the number of PIM nodes increases. In particular, we show how collective communications that are commonly found in many kernels/workloads can be problematic for PIM systems. To evaluate the impact of collective communication in PIM architectures, we provide an in-depth analysis of two workloads on the UPMEM PIM system that utilize representative common collective communication patterns -- AllReduce and All-to-All communication. Specifically, we evaluate 1) embedding tables that are commonly used in recommendation systems that require AllReduce and 2) the Number Theoretic Transform (NTT) kernel which is a critical component of Fully Homomorphic Encryption (FHE) that requires All-to-All communication. We analyze the performance benefits of these workloads and show how they can be efficiently mapped to the PIM architecture through alternative data partitioning. However, since each PIM compute unit can only access its local memory, when communication is necessary between PIM nodes (or remote data is needed), communication between the compute units must be done through the host CPU, thereby severely hampering application performance. To increase the scalability (or applicability) of PIM to future workloads, we make the case for how future PIM architectures need efficient communication or interconnection networks between the PIM nodes that require both hardware and software support.

14 March 2023 in IEEE Micro
Verified
Journal Article
Open access
NLNeal Livesay
Neal Livesay
GJGilbert Jonatan
Gilbert Jonatan
EMEvelio Mora
Evelio Mora
KSKaustubh Shivdikar
Kaustubh Shivdikar
RARashmi Agrawal
Rashmi Agrawal
David KaeliDavid Kaeli
David Kaeli
Fully Homomorphic Encryption (FHE) is a rapidly developing technology that enables computation directly on encrypted data, making it a compelling solution for security in cloud-based systems. In addition, modern FHE schemes are believed to be resistant to quantum attacks. Although FHE offers unprecedented potential for security, current implementations suffer from prohibitively high latency. Finite field arithmetic operations, particularly the multiplication of high-degree polynomials, are key computational bottlenecks. The parallel processing capabilities provided by modern Graphical Processing Units (GPUs) make them compelling candidates to target these highly parallelizable workloads. In this article, we discuss methods to accelerate polynomial multiplication with GPUs, with the goal of making FHE practical.

10 June 2024
Verified
Conference Paper
Open access
GJGilbert Jonatan
Gilbert Jonatan
HCHaeyoon Cho
Haeyoon Cho
HSHyojun Son
Hyojun Son
XWXiangyu Wu
Xiangyu Wu
NLNeal Livesay
Neal Livesay
JKJohn Kim
John Kim
Processing-in-memory (PIM) has been widely explored in academia and industry to accelerate numerous workloads. By reducing the data movement and increasing parallelism, PIM offers great performance and energy efficiency. A large amount of cores or nodes present in PIM provide massive parallelism and compute throughput; however, this also proposes challenges and limitations for some workloads. In this work, we provide an extensive evaluation and analysis of a real PIM system from UPMEM. We specifically target emerging workloads featuring collective communication, demonstrating its role as the primary limitation within current PIM architecture.

11 June 2024 in ACM SIGMETRICS Performance Evaluation Review
Verified
Journal Article
Open access
GJGilbert Jonatan
Gilbert Jonatan
HCHaeyoon Cho
Haeyoon Cho
HSHyojun Son
Hyojun Son
XWXiangyu Wu
Xiangyu Wu
NLNeal Livesay
Neal Livesay
JKJohn Kim
John Kim
Processing-in-memory (PIM) has been widely explored in academia and industry to accelerate numerous workloads. By reducing the data movement and increasing parallelism, PIM offers great performance and energy efficiency. A large amount of cores or nodes present in PIM provide massive parallelism and compute throughput; however, this also proposes challenges and limitations for some workloads. In this work, we provide an extensive evaluation and analysis of a real PIM system from UPMEM. We specifically target emerging workloads featuring collective communication, demonstrating its role as the primary limitation within current PIM architecture.