VLDB 2026 Research / reviewers in the wild / expert
Yu Gan 0002
dblp:89/8500-2
· DBLP profile ↗
10ranked-venue papers
6as first author
5since 2021 · last 2026
0000-0003-2697-9950ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 7 · 4 first-author · 4 since 2021Systems, architecture and hardware · 5 · 4 first-author · 3 since 2021Computer networks · 3 · 2 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Critical Path Guided Decision Making with CALLIGATOR
Meghna Pancholi, Lee Baugh, Olaf Schnapauff, David E. Culler, Kostis Kaffes, Yu Gan 0002, Brent E. Stephens |
SIGCOMM | 6 |
| 2025 | IC-Cache: Efficient Large Language Model Serving via In-context CachingabstractLarge language models (LLMs) have excelled in various applications, yet serving them at scale is challenging due to their substantial resource demands and high latency. Our real-world studies reveal that over 70% of user requests to LLMs have semantically similar counterparts, suggesting the potential for knowledge transfer among requests. However, naively caching and reusing past responses leads to a big quality drop. Yu Gan 0002, Nikhil Sarda, Lillian Tsai, Yanqi Zhou, Arvind Krishnamurthy, Fan Lai 0001, Henry M. Levy, David E. Culler |
SOSP | 2 |
| 2023 | Sleuth: A Trace-Based Root Cause Analysis System for Large-Scale Microservices with Graph Neural NetworksabstractCloud microservices are being scaled up due to the rising demand for new features and the convenience of cloud-native technologies. However, the growing scale of microservices complicates the remote procedure call (RPC) dependency graph, exacerbates the tail-of-scale effect, and makes many of the empirical rules for detecting the root cause of end-to-end performance issues unreliable. Additionally, existing open-source microservice benchmarks are too small to evaluate performance debugging algorithms at a production-scale with hundreds or even thousands of services and RPCs. Yu Gan 0002, Guiyang Liu, Qi Zhou 0001, Jiesheng Wu, Jiangwei Jiang |
ASPLOS (4) | 1 |
| 2023 | Ditto: End-to-End Application Cloning for Networked Cloud ServicesabstractThe lack of representative, publicly-available cloud services has been a recurring problem in the architecture and systems communities. While open-source benchmarks exist, they do not capture the full complexity of cloud services. Application cloning is a promising way to address this, however, prior work is limited to CPU-/cache-centric, single-node services, operating at user level. Mingyu Liang, Yu Gan 0002, Abhishek Dhanotia, Mahesh Ketkar, Christina Delimitrou |
ASPLOS (2) | 2 |
| 2021 | Sage: practical and scalable ML-driven performance debugging in microservicesabstractCloud applications are increasingly shifting from large monolithic services to complex graphs of loosely-coupled microservices. Despite the advantages of modularity and elasticity microservices offer, they also complicate cluster management and performance debugging, as dependencies between tiers introduce backpressure and cascading QoS violations. Prior work on performance debugging for cloud services either relies on empirical techniques, or uses supervised learning to diagnose the root causes of performance issues, which requires significant application instrumentation, and is difficult to deploy in practice. Yu Gan 0002, Mingyu Liang, Sundar Dev, David Lo 0003, Christina Delimitrou |
ASPLOS | 1 |
| 2019 | An Open-Source Benchmark Suite for Microservices and Their Hardware-Software Implications for Cloud & Edge SystemsabstractCloud services have recently started undergoing a major shift from monolithic applications, to graphs of hundreds or thousands of loosely-coupled microservices. Microservices fundamentally change a lot of assumptions current cloud systems are designed with, and present both opportunities and challenges when optimizing for quality of service (QoS) and cloud utilization. Yu Gan 0002, Dailun Cheng, Ankitha Shetty, Priyal Rathi, Nayan Katarki, Ariana Bruno, Justin Hu, Brian Ritchken, Brendon Jackson, Kelvin Hu, Meghna Pancholi, Yuan He 0015, Brett Clancy, Chris Colen, Fukang Wen, Catherine Leung, Leon Zaruvinsky, Mateo Espinosa Zarlenga, Rick Lin, Zhongling Liu, Jake Padilla, Christina Delimitrou |
ASPLOS | 1 |
| 2019 | Seer: Leveraging Big Data to Navigate the Complexity of Performance Debugging in Cloud MicroservicesabstractPerformance unpredictability is a major roadblock towards cloud adoption, and has performance, cost, and revenue ramifications. Predictable performance is even more critical as cloud services transition from monolithic designs to microservices. Detecting QoS violations after they occur in systems with microservices results in long recovery times, as hotspots propagate and amplify across dependent services. We present Seer, an online cloud performance debugging system that leverages deep learning and the massive amount of tracing data cloud systems collect to learn spatial and temporal patterns that translate to QoS violations. Seer combines lightweight distributed RPC-level tracing, with detailed low-level hardware monitoring to signal an upcoming QoS violation, and diagnose the source of unpredictable performance. Once an imminent QoS violation is detected, Seer notifies the cluster manager to take action to avoid performance degradation altogether. We evaluate Seer both in local clusters, and in large-scale deployments of end-to-end applications built with microservices with hundreds of users. We show that Seer correctly anticipates QoS violations 91% of the time, and avoids the QoS violation to begin with in 84% of cases. Finally, we show that Seer can identify application-level design bugs, and provide insights on how to better architect microservices to achieve predictable performance. Yu Gan 0002, Kelvin Hu, Dailun Cheng, Yuan He 0015, Meghna Pancholi, Christina Delimitrou |
ASPLOS | 1 |
| 2019 | µqSim: Enabling Accurate and Scalable Simulation for Interactive MicroservicesabstractCurrent cloud services are moving away from monolithic designs and towards graphs of many loosely-coupled, single-concerned microservices. Microservices have several advantages, including speeding up development and deployment, allowing specialization of the software infrastructure, and helping with debugging and error isolation. At the same time they introduce several hardware and software challenges. Given that most of the performance and efficiency implications of microservices happen at scales larger than what is available outside production deployments, studying such effects requires designing the right simulation infrastructures. We present j);qSim, a scalable and validated queueing network simulator designed specifically for interactive microser-vices. μqSim provides detailed intra- and inter-microservice models that allow it to faithfully reproduce the behavior of complex, many-tier applications. μqSim is also modular, allowing reuse of individual models across microservices and end-to-end applications. We have validated μqSim both against simple and more complex microservices graphs, and have shown that it accurately captures performance in terms of throughput and tail latency. Finally, we use μqSim to model the tail at scale effects of request fanout, and the performance impact of power management in latency -sensitive microservices. Yu Gan 0002, Christina Delimitrou |
ISPASS | 2 |
| 2016 | Secure Collaborative Spectrum Sensing: A Peer-Prediction MethodabstractCollaborative spectrum sensing is an effective method to improve detection rates in cognitive radio networks. However, it is vulnerable to spectrum sensing data falsification (SSDF) attacks when malicious secondary users (SUs) report fraudulent sensing data. In order to improve the robustness, numerous attack prevention schemes have been proposed to identify malicious SUs. Nevertheless, most of them neglect to incentivize SUs to send truthful reports. An incentive method based on peer-prediction is proposed to identify malicious suspects, punish attackers, and incentivize SUs to send truthful reports simultaneously for decision fusion. Moreover, continuous peer-prediction derived from the binary case is introduced, which is capable of preventing attacks in the continuous domain. Theoretical analysis and simulation results demonstrate that honest SUs are rewarded for accurate and truthful sensing results, while malicious SUs incur penalty for making falsified sensing reports. A significant improvement of detection rates is obtained by the proposed scheme when there are no more than half of malicious SUs conducting SSDF attacks. Yu Gan 0002, Chunxiao Jiang, Norman C. Beaulieu, Jian Wang 0030, Yong Ren 0001 |
IEEE Trans. Commun. | 1 |
| 2015 | Incentive Attack Prevention for Collaborative Spectrum Sensing: A Peer-Prediction MethodabstractCollaborative spectrum sensing is an effective method to improve the detection rate in cognitive radio. However, it is vulnerable to spectrum sensing data falsification attacks. In order to improve the robustness, numerous attack prevention schemes have been proposed to identify malicious secondary users (SUs). Nevertheless, most of them neglect to incentivize SUs to send truthful reports. Therefore, an incentive method based on Private-Prior Peer-Prediction with approximate subjective priors is proposed to identify malicious suspects and punish attackers when falsifying the sensing data simultaneously. The theoretical analysis and simulation results demonstrate that honest SUs are rewarded by accurate and truthful sensing results while malicious SUs receive heavy loss for making falsified sensing results. Moreover, a significant improvement of detection rates is demonstrated when there are a large number of malicious SUs conducting cooperative attacks compared to the pure majority rule scheme. Yu Gan 0002, Chunxiao Jiang, Wei Zhang 0001, Norman C. Beaulieu, Yong Ren 0001 |
GLOBECOM | 1 |