Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Crankshaw

dblp:132/8701 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
3since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 1 first-author · 2 since 2021Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 2 · 1 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-authorArtificial intelligence and machine learning · 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 networks
2 papers
Network management and operations · 83% Network optimization and economics · 17%
Artificial intelligence
2 papers
Trustworthy machine learning · 50% Efficient and distributed learning · 25% Learning theory · 25%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Cloud and datacenter computing · 65% Parallel and multicore computing · 18% Energy-efficient computing · 17%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

Topics — the 12 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design › fair division › max-min fairness
max-min fair allocation
0.812024
Solving Max-Min Fair Resource Allocations Quickly on Large Graphs · NSDI 2024
Machine learning › Trustworthy machine learning
robustness
0.612022
SOL: safe on-node learning in cloud platforms · ASPLOS 2022
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.612022
SOL: safe on-node learning in cloud platforms · ASPLOS 2022
Machine learning › Efficient and distributed learning
inference serving
0.312017
Clipper: A Low-Latency Online Prediction Serving System · NSDI 2017
Machine learning › Learning theory › online learning
online prediction
0.312017
Clipper: A Low-Latency Online Prediction Serving System · NSDI 2017
Network management and operations
failure recovery
0.312025
Enhancing Network Failure Mitigation with Performance-Aware Ranking · NSDI 2025
Network optimization and economics
resource allocation
0.212024
Solving Max-Min Fair Resource Allocations Quickly on Large Graphs · NSDI 2024
Parallel and multicore computing
graph processing
0.212014
GraphX: Graph Processing in a Distributed Dataflow Framework · OSDI 2014
Operating systems
resource management
0.212022
SOL: safe on-node learning in cloud platforms · ASPLOS 2022
Energy-efficient computing
power management
0.212022
SOL: safe on-node learning in cloud platforms · ASPLOS 2022
Cloud and datacenter computing › inference serving
low-latency serving
0.112017
Clipper: A Low-Latency Online Prediction Serving System · NSDI 2017
Graph data management
distributed graph processing
0.112014
GraphX: Graph Processing in a Distributed Dataflow Framework · OSDI 2014

Methods — techniques the papers use, named apart from their topics

machine learning · 1.7
YearPublicationVenuePosition
2025 Enhancing Network Failure Mitigation with Performance-Aware Ranking
Pooria Namyar, Arvin Ghavidel, Daniel Crankshaw, Daniel S. Berger, Kevin Hsieh, Srikanth Kandula, Ramesh Govindan, Behnaz Arzani
NSDI3
2024 Solving Max-Min Fair Resource Allocations Quickly on Large Graphs
Pooria Namyar, Behnaz Arzani, Srikanth Kandula, Santiago Segarra, Daniel Crankshaw, Umesh Krishnaswamy, Ramesh Govindan, Himanshu Raj
NSDI5
2022 SOL: safe on-node learning in cloud platforms
abstract
Cloud platforms run many software agents on each server node. These agents manage all aspects of node operation, and in some cases frequently collect data and make decisions. Unfortunately, their behavior is typically based on pre-defined static heuristics or offline analysis; they do not leverage on-node machine learning (ML). In this paper, we first characterize the spectrum of node agents in Azure, and identify the classes of agents that are most likely to benefit from on-node ML. We then propose SOL, an extensible framework for designing ML-based agents that are safe and robust to the range of failure conditions that occur in production. SOL provides a simple API to agent developers and manages the scheduling and running of the agent-specific functions they write. We illustrate the use of SOL by implementing three ML-based agents that manage CPU cores, node power, and memory placement. Our experiments show that (1) ML substantially improves our agents, and (2) SOL ensures that agents operate safely under a variety of failure conditions. We conclude that ML-based agents show significant potential and that SOL can help build them.
Daniel Crankshaw, Neeraja J. Yadwadkar, Daniel S. Berger, Christoforos E. Kozyrakis, Ricardo Bianchini
ASPLOS2
2020 InferLine: latency-aware provisioning and scaling for prediction serving pipelines
abstract
Serving ML prediction pipelines spanning multiple models and hardware accelerators is a key challenge in production machine learning. Optimally configuring these pipelines to meet tight end-to-end latency goals is complicated by the interaction between model batch size, the choice of hardware accelerator, and variation in the query arrival process.
Daniel Crankshaw, Gur-Eyal Sela, Xiangxi Mo, Corey Zumar, Ion Stoica, Joseph Gonzalez 0001, Alexey Tumanov
SoCC1
2018 IDK Cascades: Fast Deep Learning by Learning not to Overthink
Xin Wang 0066, Yujia Luo, Daniel Crankshaw, Alexey Tumanov, Fisher Yu 0001, Joseph Gonzalez 0001
UAI3
2017 Clipper: A Low-Latency Online Prediction Serving System
Daniel Crankshaw, Xin Wang 0066, Giulio Zhou, Michael J. Franklin, Joseph Gonzalez 0001, Ion Stoica
NSDI1
2015 The Missing Piece in Complex Analytics: Low Latency, Scalable Model Management and Serving with Velox
Daniel Crankshaw, Peter Bailis, Joseph Gonzalez 0001, Haoyuan Li 0001, Zhao Zhang 0007, Michael J. Franklin, Ali Ghodsi 0002, Michael I. Jordan
CIDR1
2014 GraphX: Graph Processing in a Distributed Dataflow Framework
Joseph Gonzalez 0001, Reynold Xin, Ankur Dave, Daniel Crankshaw, Michael J. Franklin, Ion Stoica
OSDI4
2013 Inverted indices for particle tracking in petascale cosmological simulations
abstract
We describe the challenges arising from tracking dark matter particles in state of the art cosmological simulations. We are in the process of running the Indra suite of simulations, with an aggregate count of more than 35 trillion particles and 1.1PB of total raw data volume. However, it is not enough just to store the particle positions and velocities in an efficient manner -- analyses also need to be able to track individual particles efficiently through the temporal history of the simulation. The required inverted indices can easily have raw sizes comparable to the original simulation.
Daniel Crankshaw, Randal C. Burns, Bridget Falck, Tamás Budavári, Alex Szalay, Jie Wang 0075
SSDBM1