Demo Data from VLDB 2026 / reviewers in the wild / expert
Wookeun Jung
dblp:151/5459
· DBLP profile ↗
6ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0001-6750-6979ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 3 · 1 first-author · 1 since 2021Security and privacy · 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
4 papers |
GPUs and heterogeneous computing · 57% Hardware accelerators and domain-specific architectures · 20% Memory systems · 17% | |
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% | |
| Artificial intelligence
2 papers |
Reinforcement learning · 84% Deep learning architectures and training · 16% | |
| Network and information security
1 paper |
Network security · 100% |
Topics — the 9 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
deep learning compiler |
0.5 | 1 | 2021 | DeepCuts: a deep learning optimization framework for versatile GPU workloads · PLDI 2021 |
Compilers and program optimization › deep learning compiler
operator fusion |
0.5 | 1 | 2021 | DeepCuts: a deep learning optimization framework for versatile GPU workloads · PLDI 2021 |
GPUs and heterogeneous computing
GPU kernel optimization |
0.5 | 1 | 2021 | DeepCuts: a deep learning optimization framework for versatile GPU workloads · PLDI 2021 |
Machine learning › Reinforcement learning › actor-critic methods
asynchronous advantage actor-critic |
0.4 | 1 | 2019 | FA3C: FPGA-Accelerated Deep Reinforcement Learning · ASPLOS 2019 |
Machine learning › Reinforcement learning
deep reinforcement learning |
0.4 | 1 | 2019 | FA3C: FPGA-Accelerated Deep Reinforcement Learning · ASPLOS 2019 |
Hardware accelerators and domain-specific architectures
machine learning accelerator |
0.4 | 1 | 2019 | FA3C: FPGA-Accelerated Deep Reinforcement Learning · ASPLOS 2019 |
GPUs and heterogeneous computing
GPU memory management |
0.3 | 1 | 2018 | Transparent GPU memory management for DNNs · PPoPP 2018 |
GPUs and heterogeneous computing › CPU-GPU heterogeneous computing
CPU-GPU heterogeneous systems |
0.2 | 1 | 2016 | PIPSEA: A Practical IPsec Gateway on Embedded APUs · CCS 2016 |
Reconfigurable computing and FPGAs
FPGA accelerator |
0.1 | 1 | 2019 | FA3C: FPGA-Accelerated Deep Reinforcement Learning · ASPLOS 2019 |
Methods — techniques the papers use, named apart from their topics
kernel fusion · 1.5auto-tuning · 1.5single-precision floating-point arithmetic · 0.8FPGA-based training · 0.8zero-copy packet i/o · 0.5OpenCL · 0.5DPDK · 0.5heuristic scheduling · 0.3ILP-based scheduling · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | DeepCuts: a deep learning optimization framework for versatile GPU workloadsabstractWidely used Deep Learning (DL) frameworks, such as TensorFlow, PyTorch, and MXNet, heavily rely on the NVIDIA cuDNN for performance. However, using cuDNN does not always give the best performance. One reason is that it is hard to handle every case of versatile DNN models and GPU architectures with a library that has a fixed implementation. Another reason is that cuDNN lacks kernel fusion functionality that gives a lot of chances to improve performance. In this paper, we propose a DL optimization framework for versatile GPU workloads, called DeepCuts. It considers both kernel implementation parameters and GPU architectures. It analyzes the DL workload, groups multiple DL operations into a single GPU kernel, and generates optimized GPU kernels considering kernel implementation parameters and GPU architecture parameters. The evaluation result with various DL workloads for inference and training indicates that DeepCuts outperforms cuDNN/cuBLAS-based implementations and the state-of-the-art DL optimization frameworks, such as TVM, TensorFlow XLA, and TensorRT. Wookeun Jung, Thanh Tuan Dao, Jaejin Lee |
PLDI | 1 |
| 2019 | FA3C: FPGA-Accelerated Deep Reinforcement LearningabstractDeep Reinforcement Learning (Deep RL) is applied to many areas where an agent learns how to interact with the environment to achieve a certain goal, such as video game plays and robot controls. Deep RL exploits a DNN to eliminate the need for handcrafted feature engineering that requires prior domain knowledge. The Asynchronous Advantage Actor-Critic (A3C) is one of the state-of-the-art Deep RL methods. In this paper, we present an FPGA-based A3C Deep RL platform, called FA3C. Traditionally, FPGA-based DNN accelerators have mainly focused on inference only by exploiting fixed-point arithmetic. Our platform targets both inference and training using single-precision floating-point arithmetic. We demonstrate the performance and energy efficiency of FA3C using multiple A3C agents that learn the control policies of six Atari 2600 games. Its performance is better than a high-end GPU-based platform (NVIDIA Tesla P100). FA3C achieves 27.9% better performance than that of a state-of-the-art GPU-based implementation. Moreover, the energy efficiency of FA3C is 1.62x better than that of the GPU-based implementation. Hyungmin Cho, Pyeongseok Oh, Wookeun Jung, Jaejin Lee |
ASPLOS | 4 |
| 2018 | Transparent GPU memory management for DNNsabstractModern DNN frameworks exploit GPU acceleration by default to achieve high performance. The limitation of GPU memory capacity becomes a serious problem because DNNs are becoming deeper and larger. This paper proposes a purely software-based transparent solution, called tvDNN, to the GPU memory capacity problem. It is based on GPU memory swapping and memory object sectioning techniques. It also provides an efficient memory-object swapping schedule based on ILP (optimal) and heuristics (suboptimal). The experimental results show that tvDNN enables Caffe to build VGG-16 with a large batch size, such as 256 or 512, using a few GB of GPU memory without significant performance degradation. Jung-Ho Park, Hyungmin Cho, Wookeun Jung, Jaejin Lee |
PPoPP | 3 |
| 2017 | Performance analysis of CNN frameworks for GPUsabstractThanks to modern deep learning frameworks that exploit GPUs, convolutional neural networks (CNNs) have been greatly successful in visual recognition tasks. In this paper, we analyze the GPU performance characteristics of five popular deep learning frameworks: Caffe, CNTK, TensorFlow, Theano, and Torch in the perspective of a representative CNN model, AlexNet. Based on the characteristics obtained, we suggest possible optimization methods to increase the efficiency of CNN models built by the frameworks. We also show the GPU performance characteristics of different convolution algorithms each of which uses one of GEMM, direct convolution, FFT, and the Winograd method. We also suggest criteria to choose convolution algorithms for GPUs and methods to build efficient CNN models on GPUs. Since scaling DNNs in a multi-GPU context becomes increasingly important, we also analyze the scalability of the CNN models built by the deep learning frameworks in the multi-GPU context and their overhead. The result indicates that we can increase the speed of training the AlexNet model up to 2X by just changing options provided by the frameworks. Heehoon Kim, Hyoungwook Nam, Wookeun Jung, Jaejin Lee |
ISPASS | 3 |
| 2016 | PIPSEA: A Practical IPsec Gateway on Embedded APUsabstractAccelerated Processing Unit (APU) is a heterogeneous multicore processor that contains general-purpose CPU cores and a GPU in a single chip. It also supports Heterogeneous System Architecture (HSA) that provides coherent physically-shared memory between the CPU and the GPU. In this paper, we present the design and implementation of a high-performance IPsec gateway using a low-cost commodity embedded APU. The HSA supported by the APUs eliminates the data copy overhead between the CPU and the GPU, which is unavoidable in the previous discrete GPU approaches. The gateway is implemented in OpenCL to exploit the GPU and uses zero-copy packet I/O APIs in DPDK. The IPsec gateway handles the real-world network traffic where each packet has a different workload. The proposed packet scheduling algorithm significantly improves GPU utilization for such traffic. It works not only for APUs but also for discrete GPUs. With three CPU cores and one GPU in the APU, the IPsec gateway achieves a throughput of 10.36 Gbps with an average latency of 2.79 ms to perform AES-CBC+HMAC-SHA1 for incoming packets of 1024 bytes. Jung-Ho Park, Wookeun Jung, Gangwon Jo, Ilkoo Lee, Jaejin Lee |
CCS | 2 |
| 2014 | Versatile and scalable parallel histogram constructionabstractHistograms are used in various fields to quickly profile the distribution of a large amount of data. However, it is challenging to efficiently utilize abundant parallel resources in modern processors for histogram construction. To make matters worse, the most efficient implementation varies depending on input parameters (e.g., input distribution, number of bins, and data type) or architecture parameters (e.g., cache capacity and SIMD width). Wookeun Jung, Jongsoo Park, Jaejin Lee |
PACT | 1 |