Demo Data from EDBT 2026 / reviewers in the wild / expert
Sunjae Kim
dblp:189/9432
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
0000-0003-3251-9475ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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 networks
1 paper |
Internet architecture and protocols · 50% Content delivery and video streaming · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › world wide web › web protocols
HTTP |
0.7 | 1 | 2023 | HTTP Steady Connections for Robust Web Acceleration · WWW 2023 |
Content delivery and video streaming › web content delivery
web acceleration |
0.7 | 1 | 2023 | HTTP Steady Connections for Robust Web Acceleration · WWW 2023 |
Methods — techniques the papers use, named apart from their topics
feedback-based reprioritization · 0.7deadline-based sequencing · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | AccelOrb: FPGA Acceleration of Orb v2 for Fast Molecular DynamicsabstractMachine learning force fields (MLFFs) offer high accuracy at reduced computational cost, but their repeated evaluation at every molecular dynamics (MD) timestep leads to prohibitive runtime, limiting simulations to short physical timescales. In this work, we accelerate Orb v2, a Graph Neural Network–based MLFF, by targeting its dominant Attention Interaction Network (AIN), which accounts for approximately 97% of inference time. We identify on-chip memory constraints and a latency-memory trade-off in block-based computation as the key challenges to efficient acceleration. To address these challenges, we propose AccelOrb, a memory-aware FPGA acceleration of AIN based on a single streaming kernel that employs a non-uniform tiling strategy to balance latency and memory footprint, and selectively maps parameters beyond BRAM. Implemented on a resource-constrained AMD Alveo U50 FPGA, our approach achieves 9.19× and 8.18× speedup over CPU and GPU baselines while operating within tight power and resource budgets. Sunjae Kim, Gwanhong Park, Jeawoo Lim, Faaiz Asim, Jongeun Lee |
FCCM | 1 |
| 2023 | HTTP Steady Connections for Robust Web AccelerationabstractHTTP’s intrinsic request-and-response traffic pattern makes most web servers often idle, leaving a potential to accelerate page loads. We present the notion of HTTP steady connections, which fully utilizes the server’s available network bandwidth during a page load using the promising HTTP/3 server push, transforming the intermittent workload of loading a page into a more steady one. To construct a proper server push policy to achieve this, we separate the structure of a page, which is a relatively static factor, from the page load environments including client and network characteristics, which are generally dynamic and unknown to servers. We formulate a deadline-based sequencing problem using a page load model with dependency graphs and design a feedback-based reprioritization mechanism within HTTP server push to reactively match client progress robustly. Experiments with a prototype and a wide range of real-world pages show that HTTP steady connections significantly improve web page loads compared with state-of-the-art accelerators, even under packet losses and without any prior knowledge of network environments. Sunjae Kim, Wonjun Lee 0001 |
WWW | 1 |