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

Sungkyun Kim

dblp:318/6786 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0008-8058-8161ORCID · reported

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

Systems, architecture and hardware · 2 · 2 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
2 papers
Hardware accelerators and domain-specific architectures · 57% Cloud and datacenter computing · 43%
Artificial intelligence
2 papers
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
model compression
1.012026
FlexiQ: Adaptive Mixed-Precision Quantization for Latency/Accuracy Trade-Offs in Deep Neural Networks · EuroSys 2026
Machine learning › Efficient and distributed learning › model compression
quantization
1.012026
FlexiQ: Adaptive Mixed-Precision Quantization for Latency/Accuracy Trade-Offs in Deep Neural Networks · EuroSys 2026
Hardware accelerators and domain-specific architectures › quantization
mixed-precision quantization
1.012026
FlexiQ: Adaptive Mixed-Precision Quantization for Latency/Accuracy Trade-Offs in Deep Neural Networks · EuroSys 2026
Hardware accelerators and domain-specific architectures › machine learning accelerator
neural network accelerator
1.012026
FlexiQ: Adaptive Mixed-Precision Quantization for Latency/Accuracy Trade-Offs in Deep Neural Networks · EuroSys 2026
Machine learning › Efficient and distributed learning
distributed inference
0.812024
ExeGPT: Constraint-Aware Resource Scheduling for LLM Inference · ASPLOS (2) 2024
Machine learning › Efficient and distributed learning › distributed training › model parallelism
tensor parallelism
0.812024
ExeGPT: Constraint-Aware Resource Scheduling for LLM Inference · ASPLOS (2) 2024
Cloud and datacenter computing › inference serving
LLM inference scheduling
0.812024
ExeGPT: Constraint-Aware Resource Scheduling for LLM Inference · ASPLOS (2) 2024
Cloud and datacenter computing › cluster resource management and scheduling
resource scheduling
0.812024
ExeGPT: Constraint-Aware Resource Scheduling for LLM Inference · ASPLOS (2) 2024
Cloud and datacenter computing
inference serving
0.212024
ExeGPT: Constraint-Aware Resource Scheduling for LLM Inference · ASPLOS (2) 2024

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

adaptive mixed-precision quantization · 2.0workload-aware allocation · 1.5round-robin allocation · 1.5batch size tuning · 1.5
YearPublicationVenuePosition
2026 FlexiQ: Adaptive Mixed-Precision Quantization for Latency/Accuracy Trade-Offs in Deep Neural Networks
abstract
Neural networks commonly execute on hardware accelerators such as NPUs and GPUs for their size and computation overhead. These accelerators are costly and it is hard to scale their resources to handle real-time workload fluctuations.
Hongjun Um, Sungkyun Kim, Yongjun Park 0001, Jiwon Seo 0002
EuroSys3
2024 ExeGPT: Constraint-Aware Resource Scheduling for LLM Inference
abstract
This paper presents ExeGPT, a distributed system designed for constraint-aware LLM inference. ExeGPT finds and runs with an optimal execution schedule to maximize inference throughput while satisfying a given latency constraint. By leveraging the distribution of input and output sequences, it effectively allocates resources and determines optimal execution configurations, including batch sizes and partial tensor parallelism. We also introduce two scheduling strategies based on Round-Robin Allocation and Workload-Aware Allocation policies, suitable for different NLP workloads.
Hyungjun Oh, Sungkyun Kim, Junyeol Lee, Du-Seong Chang, Jiwon Seo 0002
ASPLOS (2)4