Demo Data from EDBT 2026 / reviewers in the wild / expert
Jeongmin Yang
dblp:133/3939
· DBLP profile ↗
5ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021
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
1 paper |
Memory systems · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Memory systems
access latency reduction |
0.2 | 1 | 2014 | NUAT: A non-uniform access time memory controller · HPCA 2014 |
Memory systems
DRAM |
0.2 | 1 | 2014 | NUAT: A non-uniform access time memory controller · HPCA 2014 |
Memory systems › memory controller
DRAM controller |
0.2 | 1 | 2014 | NUAT: A non-uniform access time memory controller · HPCA 2014 |
Memory systems › DRAM
DRAM refresh |
0.1 | 1 | 2014 | NUAT: A non-uniform access time memory controller · HPCA 2014 |
Methods — techniques the papers use, named apart from their topics
request scoring · 0.2partitioned bank rotation · 0.2page mode selection · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Adaptive Episode Length Adjustment for Multi-agent Reinforcement Learning
Byunghyun Yoo, Younghwan Shin, Euisok Chung, Jeongmin Yang |
AAMAS | 5 |
| 2024 | MuDE: Multi-agent decomposed reward-based explorationabstractIn cooperative multi-agent reinforcement learning, agents jointly optimize a centralized value function based on the rewards shared by all agents and learn decentralized policies through value function decomposition. Although such a learning framework is considered effective, estimating individual contribution from the rewards, which is essential for learning highly cooperative behaviors, is difficult. In addition, it becomes more challenging when reinforcement and punishment, help in increasing or decreasing the specific behaviors of agents, coexist because the processes of maximizing reinforcement and minimizing punishment can often conflict in practice. This study proposes a novel exploration scheme called multi-agent decomposed reward-based exploration (MuDE), which preferably explores the action spaces associated with positive sub-rewards based on a modified reward decomposition scheme, thus effectively exploring action spaces not reachable by existing exploration schemes. We evaluate MuDE with a challenging set of StarCraft II micromanagement and modified predator-prey tasks extended to include reinforcement and punishment. The results show that MuDE accurately estimates sub-rewards and outperforms state-of-the-art approaches in both convergence speed and win rates. Byunghyun Yoo, Sungwon Yi, Younghwan Shin, Ran Han, Seungwoo Seo, Hwa Jeon Song, Euisok Chung, Jeongmin Yang |
Neural Networks | 9 |
| 2021 | Live Demonstration: A Neural Processor for AI AccelerationabstractIn this demonstration, we present AB9 SoC system, a single-chip solution for AI application. It provides the reconfigurable and programmable architecture to support the general computations for a variety of neural networks. The AB9 SoC is implemented using TSMC 28-nm process technology with a chip size of 17×23 mm2and 1GHz operating frequency. Hyeji Kim, Jaehoon Chung, Kyoung-Seon Shin, Chun-Gi Lyuh, Hyun-Mi Kim, Yong Cheol Peter Cho, Jeongmin Yang, Je-Seok Ham, Minseok Choi, Jinho Han, Young-Su Kwon |
ISCAS | 8 |
| 2014 | NUAT: A non-uniform access time memory controllerabstractWith rapid development of micro-processors, off-chip memory access becomes a system bottleneck. DRAM, a main memory in most computers, has concentrated only on capacity and bandwidth for decades to achieve high performance computing. However, DRAM access latency should also be considered to keep the development trend in multi-core era. Therefore, we propose NUAT which is a new memory controller focusing on reducing memory access latency without any modification of the existing DRAM structure. We only exploit DRAM's intrinsic phenomenon: electric charge variation in DRAM cell capacitors. Given the cost-sensitive DRAM market, it is a big advantage in terms of actual implementation. NUAT gives a score to every memory access request and the request with the highest score obtains a priority. For scoring, we introduce two new concepts: Partitioned Bank Rotation (PBR) and PBR Page Mode (PPM). First, PBR is a mechanism that draws information of access speed from refresh timing and position; the request which has faster access speed gains higher score. Second, PPM selects a better page mode between open- and close-page modes based on the information from PBR. Evaluations show that NUAT decreases memory access latency significantly for various environments. Wongyu Shin, Jeongmin Yang, Jungwhan Choi, Lee-Sup Kim |
HPCA | 2 |
| 2013 | A 7 mW 2.5 GHz spread spectrum clock generator using switch-controlled injection-locked oscillatorabstractAs electric components are integrated in the smaller area, the electromagnetic interference (EMI) becomes a serious problem. To reduce an EMI problem and increase noise immunity of electric circuit, the clock spreading is one of the most popular methods these days. This work proposes a switch-controlled injection-locked oscillator (SCILO)-based spread spectrum clock generator (SSCG) with the features including low power consumption, simple operation mechanism, and small core area. In addition, sub-harmonic injection locking is used to provide high frequency output signal. The test-chip fabricated in 0.13 μm CMOS technology provides 2.5 GHz output clock with 1 % spreading ratio. Peak reduction is 13.5 dB at 1 % spreading ratio. The proposed SSCG consumes 7 mW from 1.2 V supply and only occupies 0.034 mm2. Jeongmin Yang, Young-Ju Kim 0001, Lee-Sup Kim |
ISCAS | 1 |