VLDB 2026 Research / reviewers in the wild / expert
Rohan Shenoy
dblp:295/6479
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 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 |
Energy-efficient computing · 39% Cloud and datacenter computing · 30% Parallel and multicore computing · 30% | |
| Artificial intelligence
1 paper |
Reinforcement learning · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
policy learning |
0.9 | 1 | 2025 | Counting atoms faster: policy-based nuclear magnetic resonance pulse sequencing for atomic abundance measurement · ICML 2025 |
Energy-efficient computing › datacenter power management
carbon-aware scheduling |
0.9 | 1 | 2025 | Carbon- and Precedence-Aware Scheduling for Data Processing Clusters · SIGCOMM 2025 |
Cloud and datacenter computing
cluster resource management and scheduling |
0.9 | 1 | 2025 | Carbon- and Precedence-Aware Scheduling for Data Processing Clusters · SIGCOMM 2025 |
Parallel and multicore computing › task scheduling
task graph scheduling |
0.9 | 1 | 2025 | Carbon- and Precedence-Aware Scheduling for Data Processing Clusters · SIGCOMM 2025 |
Methods — techniques the papers use, named apart from their topics
reinforcement learning · 1.7multi-agent control · 1.7scoring-based scheduling · 0.9probability-based scheduling · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Counting atoms faster: policy-based nuclear magnetic resonance pulse sequencing for atomic abundance measurementabstractQuantifying the elemental composition of a material is a general scientific challenge with broad relevance to environmental sustainability. Existing techniques for the measurement of atomic abundances generally require laboratory conditions and expensive equipment. As a result, they cannot be deployed in situ without significant capital investment, limiting their proliferation. Measurement techniques based on nuclear magnetic resonance (NMR) hold promise in this setting due to their applicability across the periodic table, their non-destructive manipulation of samples, and their amenability to in silico optimization. In this work, we learn policies to modulate NMR pulses for rapid atomic abundance quantification. Our approach involves three inter-operating agents which (1) rapidly align nuclear spins for measurement, (2) quickly force relaxation to equilibrium, and (3) toggle control between agents (1) and (2) to minimize overall measurement time. To demonstrate this technique, we consider a specific use case of low-magnetic-field carbon-13 quantification for low-cost, portable analysis of foodstuffs and soils. We find significant performance improvements relative to traditional NMR pulse sequencing, and discuss limitations on the applicability of this approach. Rohan Shenoy, Evan Coleman 0002, Hans Gaensbauer, Elsa Olivetti |
ICML | 1 |
| 2025 | Carbon- and Precedence-Aware Scheduling for Data Processing ClustersabstractAs large-scale data processing workloads continue to grow, their carbon footprint raises concerns. Prior research on carbon-aware schedulers has focused on shifting computation to align with the availability of low-carbon energy, but these approaches assume that each task can be executed independently. In contrast, data processing jobs have precedence constraints that complicate decisions, since delaying an upstream "bottleneck" task to a low-carbon period also blocks downstream tasks, impacting makespan. In this paper, we show that carbon-aware scheduling for data processing benefits from knowledge of both time-varying carbon and precedence constraints. Our main contribution is PCAPS, a carbon-aware scheduler that builds on state-of-the-art scoring or probability-based techniques - in doing so, it explicitly relates the structural importance of each task against the time-varying characteristics of carbon intensity. To illustrate gains due to fine-grained task-level scheduling, we also study CAP, a wrapper for any carbon-agnostic scheduler that generalizes the provisioning ideas of PCAPS. Both techniques allow a user-configurable priority between carbon and makespan, and we give basic analytic results to relate the trade-off between these objectives. Our prototype on a 100-node Kubernetes cluster shows that a moderate configuration of PCAPS reduces carbon footprint by up to 32.9% without significantly impacting total efficiency. Adam Lechowicz, Rohan Shenoy, Noman Bashir, Mohammad Hajiesmaili, Adam Wierman, Christina Delimitrou |
SIGCOMM | 2 |