EDBT 2026 Demo / reviewers in the wild / expert
Joel Wee
dblp:367/3969
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0005-3518-3526ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 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.
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% |
Topics — the 3 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.9 | 1 | 2025 | PartIR: Composing SPMD Partitioning Strategies for Machine Learning · ASPLOS (1) 2025 |
Machine learning › Efficient and distributed learning › distributed training › parallelization
model partitioning |
0.9 | 1 | 2025 | PartIR: Composing SPMD Partitioning Strategies for Machine Learning · ASPLOS (1) 2025 |
Parallel and multicore computing
parallelization strategies |
0.9 | 1 | 2025 | PartIR: Composing SPMD Partitioning Strategies for Machine Learning · ASPLOS (1) 2025 |
Methods — techniques the papers use, named apart from their topics
schedule-like API · 1.7intermediate representation rewriting · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | PartIR: Composing SPMD Partitioning Strategies for Machine LearningabstractTraining modern large neural networks (NNs) requires a combination of parallelization strategies, including data, model, or optimizer sharding. To address the growing complexity of these strategies, we introduce PartIR, a hardware-and-runtime agnostic NN partitioning system. PartIR is: 1) Expressive: It allows for the composition of multiple sharding strategies, whether user-defined or automatically derived; 2) Decoupled: the strategies are separate from the ML implementation; and 3) Predictable: It follows a set of well-defined general rules to partition the NN. PartIR utilizes a schedule-like API that incrementally rewrites the ML program intermediate representation (IR) after each strategy, allowing simulators and users to verify the strategy's performance. PartIR has been successfully used both for training large models and across diverse model architectures, demonstrating its predictability, expressiveness, and performance. Sami Alabed, Daniel Belov, Bart Chrzaszcz, Juliana Franco, Dominik Grewe, Dougal Maclaurin, James Molloy, Tom Natan, Tamara Norman, Xiaoyue Pan, Adam Paszke, Norman A. Rink, Michael Schaarschmidt, Timur Sitdikov, Agnieszka Swietlik, Dimitrios Vytiniotis, Joel Wee |
ASPLOS (1) | 17 |