Demo Data from EDBT 2026 / reviewers in the wild / expert
Chengpo Yan
dblp:358/2674
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0009-2618-2387ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Software 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.
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware accelerators and domain-specific architectures · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
distributed training |
0.7 | 1 | 2023 | Bagpipe: Accelerating Deep Recommendation Model Training · SOSP 2023 |
Machine learning › Efficient and distributed learning › distributed training
recommendation model training |
0.7 | 1 | 2023 | Bagpipe: Accelerating Deep Recommendation Model Training · SOSP 2023 |
Methods — techniques the papers use, named apart from their topics
prefetching · 1.3caching · 1.3lookahead algorithm · 0.7look-ahead algorithm · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Bagpipe: Accelerating Deep Recommendation Model TrainingabstractDeep learning based recommendation models (DLRM) are widely used in several business critical applications. Training such recommendation models efficiently is challenging because they contain billions of embedding-based parameters, leading to significant overheads from embedding access. By profiling existing systems for DLRM training, we observe that around 75% of the iteration time is spent on embedding access and model synchronization. Our key insight in this paper is that embedding access has a specific structure which can be used to accelerate training. We observe that embedding accesses are heavily skewed, with around 1% of embeddings representing more than 92% of total accesses. Further, we also observe that during offline training we can lookahead at future batches to determine which embeddings will be needed at what iteration in the future. Based on these insights, we develop Bagpipe, a system for training deep recommendation models that uses caching and prefetching to overlap remote embedding accesses with the computation. We design an Oracle Cacher, a new component that uses a lookahead algorithm to generate optimal cache update decisions while providing strong consistency guarantees against staleness. We also design a logically replicated, physically partitioned cache and show that our design can reduce synchronization overheads in a distributed setting. Finally, we propose a disaggregated system architecture and show that our design can enable low-overhead fault tolerance. Our experiments using three datasets and four models show that Bagpipe provides a speed up of up to 5.6x compared to state of the art baselines, while providing the same convergence and reproducibility guarantees as synchronous training. Chengpo Yan, Shivaram Venkataraman |
SOSP | 2 |