EDBT 2026 Demo / reviewers in the wild / expert
Kyoung Park
dblp:01/2102
· DBLP profile ↗
8ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0003-2319-9449ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 6 · 2 since 2021Human-computer interaction and ubiquitous computing · 2Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
3 papers |
Memory systems · 75% Hardware accelerators and domain-specific architectures · 19% Performance modeling and evaluation · 6% | |
| Databases, data mining, and information retrieval
1 paper |
Machine learning and data management · 50% Data mining · 50% |
Topics — the 12 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems
memory disaggregation |
1.4 | 2 | 2024 | Computational CXL-Memory Solution for Accelerating Memory-Intensive Applications · HPCA 2024 Sidekick: Near Data Processing for Clustering Enhanced by Automatic Memory Disaggregation · DAC 2023 |
Memory systems › processing-in-memory
near-data processing |
1.4 | 2 | 2024 | Computational CXL-Memory Solution for Accelerating Memory-Intensive Applications · HPCA 2024 Sidekick: Near Data Processing for Clustering Enhanced by Automatic Memory Disaggregation · DAC 2023 |
Memory systems
processing-in-memory |
1.4 | 2 | 2024 | Computational CXL-Memory Solution for Accelerating Memory-Intensive Applications · HPCA 2024 Sidekick: Near Data Processing for Clustering Enhanced by Automatic Memory Disaggregation · DAC 2023 |
Memory systems › memory disaggregation
CXL memory disaggregation |
0.7 | 1 | 2023 | Sidekick: Near Data Processing for Clustering Enhanced by Automatic Memory Disaggregation · DAC 2023 |
Hardware accelerators and domain-specific architectures
approximate computing accelerator |
0.4 | 1 | 2020 | A3: Accelerating Attention Mechanisms in Neural Networks with Approximation · HPCA 2020 |
Performance modeling and evaluation
approximation algorithms |
0.4 | 1 | 2020 | A3: Accelerating Attention Mechanisms in Neural Networks with Approximation · HPCA 2020 |
Hardware accelerators and domain-specific architectures › machine learning accelerator › transformer accelerator
attention accelerator |
0.4 | 1 | 2020 | A3: Accelerating Attention Mechanisms in Neural Networks with Approximation · HPCA 2020 |
Hardware accelerators and domain-specific architectures › machine learning accelerator
neural network accelerator |
0.4 | 1 | 2020 | A3: Accelerating Attention Mechanisms in Neural Networks with Approximation · HPCA 2020 |
Memory systems › memory management
memory sharing |
0.2 | 1 | 2024 | Computational CXL-Memory Solution for Accelerating Memory-Intensive Applications · HPCA 2024 |
Data mining › clustering
clustering acceleration |
0.2 | 1 | 2023 | Sidekick: Near Data Processing for Clustering Enhanced by Automatic Memory Disaggregation · DAC 2023 |
Machine learning and data management
data management for machine learning |
0.2 | 1 | 2023 | Sidekick: Near Data Processing for Clustering Enhanced by Automatic Memory Disaggregation · DAC 2023 |
Machine learning › Deep learning architectures and training
attention mechanism |
0.1 | 1 | 2020 | A3: Accelerating Attention Mechanisms in Neural Networks with Approximation · HPCA 2020 |
Methods — techniques the papers use, named apart from their topics
program context analysis · 1.3genetic algorithm · 1.3hardware specialization · 0.9algorithmic approximation · 0.9prototype demonstration · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Computational CXL-Memory Solution for Accelerating Memory-Intensive ApplicationsabstractCXL interface is the up-to-date technology that enables effective memory expansion by providing a memory-sharing protocol in configuring heterogeneous devices. However, its limited physical bandwidth can be a significant bottleneck for emerging data-intensive applications. In this work, we propose a novel CXL-based memory disaggregation architecture with a real-world prototype demonstration, which overcomes the bandwidth limitation of the CXL interface using near-data processing. The experimental results demonstrate that our design achieves up to 1.9× better performance/power efficiency than the existing CPU system. Joonseop Sim, Soohong Ahn, Taeyoung Ahn, Seungyong Lee 0005, Myunghyun Rhee, Kwangsik Shin, Donguk Moon, Euiseok Kim, Kyoung Park |
HPCA | 10 |
| 2023 | Sidekick: Near Data Processing for Clustering Enhanced by Automatic Memory DisaggregationabstractNear Data Processing (NDP) is a promising solution for data mining/analysis techniques, which extract useful information from big data. In this paper, we propose a novel NDP-enabled memory disaggregation system called Sidekick, based on a type-2 CXL device and enhanced by an automated allocation technique for clustering algorithms. The key enabler of our migration technique is to understand clustering workflows in a unit of the program context, which is the function call stack for functions, threads, and memory allocations to drive the automated decision. The proposed technique relates the migrated computation tasks with a series of function calls and performs GA-based optimization to identify the optimal allocation scenario for a target clustering algorithm. In Scikit-learn, a popular machine learning library, we use the genetic algorithm to find the optimal memory allocation policy and the operation offloading policy using the program context. The results show that the proposed technique increases the clustering performance as compared to the case, which only uses disaggregated memory without NDP cores, by up to 92% in terms of execution time, while reducing the majority of remote CXL memory accesses. Minho Ha, Byungil Koh, Kyoung Park, Yeseong Kim |
DAC | 5 |
| 2020 | Position: GPUKV: Towards a GPU-Driven Computing on Key-Value SSD
Min-Gyo Jeong, Chang-Gyu Lee, DongGyu Park, Sungyong Park, Youngjae Kim 0001, Jungki Noh, Woosuk Chung, Kyoung Park |
HotStorage | 8 |
| 2020 | A3: Accelerating Attention Mechanisms in Neural Networks with ApproximationabstractWith the increasing computational demands of the neural networks, many hardware accelerators for the neural networks have been proposed. Such existing neural network accelerators often focus on popular neural network types such as convolutional neural networks (CNNs) and recurrent neural networks (RNNs); however, not much attention has been paid to attention mechanisms, an emerging neural network primitive that enables neural networks to retrieve most relevant information from a knowledge-base, external memory, or past states. The attention mechanism is widely adopted by many state-of-the-art neural networks for computer vision, natural language processing, and machine translation, and accounts for a large portion of total execution time. We observe today's practice of implementing this mechanism using matrix-vector multiplication is suboptimal as the attention mechanism is semantically a content-based search where a large portion of computations ends up not being used. Based on this observation, we design and architect A3, which accelerates attention mechanisms in neural networks with algorithmic approximation and hardware specialization. Our proposed accelerator achieves multiple orders of magnitude improvement in energy efficiency (performance/watt) as well as substantial speedup over the state-of-the-art conventional hardware. Tae Jun Ham, Sungjun Jung, Seonghak Kim, Young H. Oh, Yeonhong Park, Yoonho Song, Jung-Hun Park, Sanghee Lee 0002, Kyoung Park, Jae W. Lee, Deog-Kyoon Jeong |
HPCA | 9 |
| 2019 | iLSM-SSD: An Intelligent LSM-Tree Based Key-Value SSD for Data AnalyticsabstractSeveral key-value stores such as RocksDB and MongoDB are implemented on the file system using the Log-Structured Merge-Tree (LSM-tree). The LSM-tree involves high compaction overhead. To minimize this overhead, WiscKey, the state-of-the-art LSM-tree, separates key and value, appends the value to the Value Log file, and LSM-tree manages only the key and Value Log offset. This minimizes the compaction overhead by reducing the number of SSTables managed by the LSM-tree. However, WiscKey still has a high I/O stack overhead that must go through the OS file system and block-layer. Therefore, this paper proposes iLSM-SSD that implements WiscKey in SSD and supports near-data processing. iLSM-SSD has the following features: (i) iLSM-SSD implements a key-value separation based LSM-tree in a limited memory space inside the SSD. (ii) The Value Log offset update management overhead incurred during the Value Log cleaning has a significant performance impact on CPU and memory-constrained SSD environments. To minimize this overhead, iLSM-SSD implements Scattered Logging, which reuses invalidated Value Log pages on the Value Log. (iii) iLSM-SSD manages the data layout internally. This enables iLSM-SSD to eliminate the need for file system interactions to obtain the data layout for in-storage processing on traditional block-interface-based SSDs. We prototyped the iLSM-SSD on the Cosmos+ OpenSSD platform in a Linux environment. Extensive evaluations with synthetic benchmarks have shown that the PUT performance of iLSM-SSD is 1.6-4 times higher than that of WiscKey implemented in RocksDB. Chang-Gyu Lee, Hyeongu Kang, DongGyu Park, Sungyong Park, Youngjae Kim 0001, Jungki Noh, Woosuk Chung, Kyoung Park |
MASCOTS | 8 |
| 2007 | Implementation and Optimization Issues of the Triangular Patch-Based Terrain System
Choong-Gyoo Lim, Seungjo Bae, Kyoung Park, Youngjik Lee |
ICEC | 3 |
| 2005 | The HandWave Bluetooth Skin Conductance Sensor
Marc Strauss, Carson Reynolds, Stephen Hughes, Kyoung Park, Gary McDarby, Rosalind W. Picard |
ACII | 4 |
| 2002 | Linux/SimOS - A Simulation Environment for Evaluating High-Speed Communication SystemsabstractThis paper presents Linux/SimOS, a Linux operating system port to SimOS, which is a complete machine simulator from Stanford. The motivation for Linux/SimOS is to alleviate the limitations of SimOS, which only supports proprietary operating systems. The contributions made in this paper are two-fold: First, the major modifications that were necessary to run Linux on SimOS are described. Second, a detailed analysis of the UDP/IP protocol and M-VIA is performed to demonstrate the capabilities of Linux/SimOS. The simulation study shows that Linux/SimOS is capable of capturing all aspects of communication performance, including the effects of the kernel, device drivers, and network interface. Chulho Won, Ben Lee, Chansu Yu, Sangman Moh, Yong-Youn Kim, Kyoung Park |
ICPP | 6 |