Demo Data from EDBT 2026 / reviewers in the wild / expert
Neeraj Aggarwal
dblp:75/3682
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0007-5128-5017ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorSoftware 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 |
Distributed systems · 38% Parallel and multicore computing · 38% Hardware accelerators and domain-specific architectures · 23% | |
| Artificial intelligence
1 paper |
Motion planning and robot control · 56% Time series and sequential data · 44% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
distributed machine learning |
0.9 | 1 | 2025 | GraphPipe: Improving Performance and Scalability of DNN Training with Graph Pipeline Parallelism · ASPLOS (1) 2025 |
Parallel and multicore computing
pipeline parallelism |
0.9 | 1 | 2025 | GraphPipe: Improving Performance and Scalability of DNN Training with Graph Pipeline Parallelism · ASPLOS (1) 2025 |
Hardware accelerators and domain-specific architectures › machine learning accelerator
DNN training |
0.3 | 1 | 2025 | GraphPipe: Improving Performance and Scalability of DNN Training with Graph Pipeline Parallelism · ASPLOS (1) 2025 |
Hardware accelerators and domain-specific architectures
machine learning accelerator |
0.3 | 1 | 2025 | GraphPipe: Improving Performance and Scalability of DNN Training with Graph Pipeline Parallelism · ASPLOS (1) 2025 |
Robotics › Motion planning and robot control
motion planning |
0.0 | 1 | 1994 | Motion Planning Amidst Planar Moving Obstacles · ICRA 1994 |
Machine learning › Time series and sequential data
non-stationary environments |
0.0 | 1 | 1994 | Motion Planning Amidst Planar Moving Obstacles · ICRA 1994 |
Robotics › Motion planning and robot control › path planning
collision-free path planning |
0.0 | 1 | 1994 | Motion Planning Amidst Planar Moving Obstacles · ICRA 1994 |
Methods — techniques the papers use, named apart from their topics
model partitioning · 0.9graph pipeline parallelism · 0.9transient pixel representation · 0.0heuristic search · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | GraphPipe: Improving Performance and Scalability of DNN Training with Graph Pipeline ParallelismabstractDeep neural networks (DNNs) continue to grow rapidly in size, making them infeasible to train on a single device (e.g. GPU). Pipeline parallelism is commonly used in existing DNN systems to support large-scale DNN training by partitioning a DNN into multiple stages, which concurrently perform DNN computation for different micro-batches of training samples in a pipeline fashion. However, existing pipeline-parallel approaches only consider sequential pipeline stages and thus ignore the topology of a DNN, resulting in missed model-parallel opportunities. Byungsoo Jeon, Mengdi Wu, Shiyi Cao, Sunghyun Park 0004, Neeraj Aggarwal, Colin Unger, Daiyaan Arfeen, Peiyuan Liao, Xupeng Miao, Mohammad Alizadeh, Gregory R. Ganger, Tianqi Chen 0001 |
ASPLOS (1) | 6 |
| 1994 | Motion Planning Amidst Planar Moving ObstaclesabstractA method is investigated for finding a collision-free path for a mobile robot with a few degrees of freedom in a time-varying domain. The environment contains a set of obstacles with arbitrary known motion patterns. In a time-varying environment, paths are time-dependent, i.e., a path needs to be specified as a function of time, since connectivity in the environment changes over time. Given a time-varying environment, a start time, and a start location, a method is presented for finding a collision-free path from start to goal points for a finite-size robot subject to a speed bound. Our method makes use of a heuristic approach based on a transient pixel representation.> Neeraj Aggarwal, Kikuo Fujimura |
ICRA | 1 |