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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gangmuk Lim

dblp:242/8135 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
4since 2021 · last 2026
0009-0003-0891-0500ORCID · reported

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

Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Computer networks · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author

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
Cloud and datacenter computing · 45% GPUs and heterogeneous computing · 19% Distributed systems · 19%
Computer networks
1 paper
Routing and switching · 100%
Databases, data mining, and information retrieval
1 paper
Data stream processing · 100%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching
traffic engineering
1.012026
SLATE: Service Layer Traffic Engineering · NSDI 2026
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.812024
Kivi: Verification for Cluster Management · USENIX ATC 2024
Distributed systems › distributed machine learning
distributed training
0.512021
Zico: Efficient GPU Memory Sharing for Concurrent DNN Training · USENIX ATC 2021
GPUs and heterogeneous computing
GPU memory management
0.512021
Zico: Efficient GPU Memory Sharing for Concurrent DNN Training · USENIX ATC 2021
Data stream processing
quantile estimation
0.412020
Approximate Quantiles for Datacenter Telemetry Monitoring · ICDE 2020
Data stream processing
streaming analytics
0.412020
Approximate Quantiles for Datacenter Telemetry Monitoring · ICDE 2020
Performance modeling and evaluation
workload characterization
0.412020
Approximate Quantiles for Datacenter Telemetry Monitoring · ICDE 2020
Program verification
configuration verification
0.212024
Kivi: Verification for Cluster Management · USENIX ATC 2024
Program verification
system verification
0.212024
Kivi: Verification for Cluster Management · USENIX ATC 2024
Cloud and datacenter computing › datacenter operations
datacenter monitoring
0.112020
Approximate Quantiles for Datacenter Telemetry Monitoring · ICDE 2020

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

model checking · 1.5formal verification · 1.5two-level hierarchical windowing · 0.9quantile approximation · 0.9
YearPublicationVenuePosition
2026 SLATE: Service Layer Traffic Engineering
Gangmuk Lim, Aditya Prerepa, Brighten Godfrey, Radhika Mittal
NSDI1
2024 Opportunities and Challenges in Service Layer Traffic Engineering
abstract
Optimizing request routing in large microservice-based applications is difficult, especially when applications span multiple geo-distributed clusters. In this paper, inspired by ideas from network traffic engineering, we propose Service Layer Traffic Engineering (SLATE), a new framework for request routing in microservices that span multiple clusters. SLATE leverages global knowledge of cluster states and multi-hop application graphs to centrally control the flow of requests in order to optimize end-to-end application latency and cost. Realizing such a system requires tackling several technical challenges unique to service layer, such as accounting for different request traffic classes, multi-hop call trees, and application latency profiles. We identify such challenges and build a preliminary prototype that addresses some of them. Preliminary evaluations of our prototype show how SLATE outperforms the state-of-the-art global load balancing approach (used by Meta's Service Router and Google's Traffic Director) by up to 3.5× in average latency and reduces egress bandwidth cost by up to 11.6×.
Gangmuk Lim, Aditya Prerepa, Brighten Godfrey, Radhika Mittal
HotNets1
2024 Kivi: Verification for Cluster Management
Bingzhe Liu, Gangmuk Lim, Ryan Beckett, Brighten Godfrey
USENIX ATC2
2021 Zico: Efficient GPU Memory Sharing for Concurrent DNN Training
Gangmuk Lim, Jeongseob Ahn, Wencong Xiao, Youngjin Kwon, Myeongjae Jeon
USENIX ATC1
2020 Approximate Quantiles for Datacenter Telemetry Monitoring
abstract
Datacenter systems require real-time troubleshooting so as to minimize downtimes. In doing so, datacenter operators employ streaming analytics for collecting and processing datacenter telemetry over a temporal window. Quantile computation is key to this telemetry monitoring since it can summarize the typical and abnormal behavior of the monitored system. However, computing quantiles in real-time is resource-intensive as it requires processing hundreds of millions of events in seconds while providing high accuracy. To address these challenges, we propose AOMG, an efficient and accurate quantile approximation algorithm that capitalizes insights from our workload study. AOMG improves performance through two-level hierarchical windowing while offering small value errors in a wide range of quantiles by taking into account the density of underlying data distribution. Our evaluations show that AOMG estimates the exact quantiles with less than 5% relative value error for a variety of use cases while providing high throughput.
Gangmuk Lim, Mohamed S. Hassan 0002, Ze Jin, Stavros Volos, Myeongjae Jeon
ICDE1