EDBT 2026 Demo / reviewers in the wild / expert
Arnav Balyan
dblp:342/3827
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0003-1767-8515ORCID · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 70% Distributed systems · 30% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › distributed scheduling
data-aware scheduling |
0.9 | 1 | 2025 | Moirai: Optimizing Placement of Data and Compute in Hybrid Clouds · SOSP 2025 |
Cloud and datacenter computing › cloud deployment
hybrid cloud |
0.9 | 1 | 2025 | Moirai: Optimizing Placement of Data and Compute in Hybrid Clouds · SOSP 2025 |
Cloud and datacenter computing
job scheduling |
0.9 | 1 | 2025 | Moirai: Optimizing Placement of Data and Compute in Hybrid Clouds · SOSP 2025 |
Methods — techniques the papers use, named apart from their topics
dependency analysis · 0.9access prediction · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Moirai: Optimizing Placement of Data and Compute in Hybrid CloudsabstractThe deployment of large-scale data analytics between on-premise and cloud sites, i.e., hybrid clouds, requires careful partitioning of both data and computation to avoid massive networking costs. We present Moirai, a cost-optimization framework that analyzes job accesses and data dependencies and optimizes the placement of both in hybrid clouds. Moirai informs the job scheduler of data location and access predictions, so it can determine where jobs should be executed to minimize data transfer costs. Our optimizer achieves scalability and cost efficiency by exploiting recurring jobs to identify data dependencies and job access characteristics and reduces the search space by excluding data not accessed recently. Ziyue Qiu, Hojin Park, Yu-Kai Wang, Arnav Balyan, Suqiang (Jack) Song, Gregory R. Ganger, George Amvrosiadis |
SOSP | 5 |