Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ryeowook Ko

dblp:385/7444 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0006-3829-7761ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 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 · 67% Hardware accelerators and domain-specific architectures · 33%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems
cache management
0.912025
Oaken: Fast and Efficient LLM Serving with Online-Offline Hybrid KV Cache Quantization · ISCA 2025
Memory systems › cache management
KV cache management
0.912025
Oaken: Fast and Efficient LLM Serving with Online-Offline Hybrid KV Cache Quantization · ISCA 2025
Hardware accelerators and domain-specific architectures
machine learning accelerator
0.912025
Oaken: Fast and Efficient LLM Serving with Online-Offline Hybrid KV Cache Quantization · ISCA 2025
Machine learning › Efficient and distributed learning
model compression
0.312025
Oaken: Fast and Efficient LLM Serving with Online-Offline Hybrid KV Cache Quantization · ISCA 2025
Machine learning › Efficient and distributed learning › model compression
quantization
0.312025
Oaken: Fast and Efficient LLM Serving with Online-Offline Hybrid KV Cache Quantization · ISCA 2025

Methods — techniques the papers use, named apart from their topics

outlier thresholding · 1.7online-offline hybrid quantization · 1.7
YearPublicationVenuePosition
2025 Oaken: Fast and Efficient LLM Serving with Online-Offline Hybrid KV Cache Quantization
abstract
Modern Large Language Model (LLM) serving system batches multiple requests to achieve high throughput, while batching attention operations is challenging, rendering memory bandwidth a critical bottleneck.Today, to mitigate this issue, the community relies on high-end GPUs with multiple high-bandwidth memory (HBM) channels.Unfortunately, HBM's high bandwidth often comes at the expense of limited memory capacity, necessitating systems to scale, which reduces core utilization and increases costs.Moreover, recent advancements enabling longer contexts for LLMs have substantially increased the key-value (KV) cache size, further intensifying the pressures on memory capacity.To lower the pressure, the literature has explored KV cache quantization techniques, which commonly use low bitwidth (e.g., INT4) for most values, selectively using higher bitwidth (e.g., FP16) for outlier values.While this approach helps achieve high accuracy and low bitwidth simultaneously, it comes with the limitation that the cost for online outlier detection is excessively high, negating the advantages of quantization.Inspired by these insights, we propose Oaken, an acceleration solution that achieves high accuracy and high performance simultaneously through co-designing algorithm and hardware.To effectively find a sweet spot in the accuracy-performance trade-off space of KV cache quantization, Oaken employs an online-offline hybrid approach, setting outlier thresholds offline, which are then used to determine the quantization scale online.To translate the proposed algorithmic technique into tangible performance gains, Oaken also comes with custom quantization/dequantization engines and memory management units that can be integrated with any LLM accelerators.We built an Oaken accelerator on top of
Minsu Kim 0004, Seongmin Hong, Ryeowook Ko, Soongyu Choi, Hunjong Lee, Junsoo Kim 0002, Joo-Young Kim 0001, Jongse Park
ISCA3