Demo Data from VLDB 2026 / reviewers in the wild / expert
Ergin Seyfe
dblp:217/6620
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
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 |
Distributed systems · 24% High-performance computing · 19% Cloud and datacenter computing · 19% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip › interprocessor communication
all-to-all communication |
0.3 | 1 | 2018 | Riffle: optimized shuffle service for large-scale data analytics · EuroSys 2018 |
Distributed systems › distributed data processing
data shuffling |
0.3 | 1 | 2018 | Riffle: optimized shuffle service for large-scale data analytics · EuroSys 2018 |
Storage systems › i/o optimization
disk i/o optimization |
0.3 | 1 | 2018 | Riffle: optimized shuffle service for large-scale data analytics · EuroSys 2018 |
High-performance computing › data-intensive computing
large-scale data analytics |
0.3 | 1 | 2018 | Riffle: optimized shuffle service for large-scale data analytics · EuroSys 2018 |
Cloud and datacenter computing › big data platform
shuffle service |
0.3 | 1 | 2018 | Riffle: optimized shuffle service for large-scale data analytics · EuroSys 2018 |
Methods — techniques the papers use, named apart from their topics
shuffle optimization · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Riffle: optimized shuffle service for large-scale data analyticsabstractThe rapidly growing size of data and complexity of analytics present new challenges for large-scale data processing systems. Modern systems keep data partitions in memory for pipelined operators, and persist data across stages with wide dependencies on disks for fault tolerance. While processing can often scale well by splitting jobs into smaller tasks for better parallelism, all-to-all data transfer---called shuffle operations---become the scaling bottleneck when running many small tasks in multi-stage data analytics jobs. Our key observation is that this bottleneck is due to the superlinear increase in disk I/O operations as data volume increases. Ergin Seyfe, Avery Ching, Michael J. Freedman |
EuroSys | 3 |