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

Benjamin Hindman

dblp:57/3356 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
3since 2021 · last 2023
—ORCID · none

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

Computer networks · 3 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 3 · 2 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
5 papers
Cloud and datacenter computing · 57% Distributed systems · 36% Performance modeling and evaluation · 6%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%

Topics — the 7 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
resource allocation
0.732023
Cilantro: Performance-Aware Resource Allocation for General Objectives via Online Feedback · OSDI 2023
Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center · NSDI 2011
Dominant Resource Fairness: Fair Allocation of Multiple Resource Types · NSDI 2011
Cloud and datacenter computing
cluster resource management and scheduling
0.712023
Cilantro: Performance-Aware Resource Allocation for General Objectives via Online Feedback · OSDI 2023
Distributed systems › distributed scheduling
distributed task scheduling
0.512021
Ownership: A Distributed Futures System for Fine-Grained Tasks · NSDI 2021
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.222011
Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center · NSDI 2011
Dominant Resource Fairness: Fair Allocation of Multiple Resource Types · NSDI 2011
Distributed systems › distributed resource management
fair resource allocation
0.112011
Dominant Resource Fairness: Fair Allocation of Multiple Resource Types · NSDI 2011
Cloud and datacenter computing › resource management
resource oversubscription
0.112010
Composing parallel software efficiently with lithe · PLDI 2010
Cloud and datacenter computing › resource management › resource allocation and scheduling
multi-resource fairness
0.012011
Dominant Resource Fairness: Fair Allocation of Multiple Resource Types · NSDI 2011

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

online feedback optimization · 0.7
YearPublicationVenuePosition
2023 Cilantro: Performance-Aware Resource Allocation for General Objectives via Online Feedback
Romil Bhardwaj, Kirthevasan Kandasamy, Asim Biswal, Wenshuo Guo, Benjamin Hindman, Joseph Gonzalez 0001, Michael I. Jordan, Ion Stoica
OSDI5
2021 In reference to RPC: it's time to add distributed memory
abstract
RPC has been remarkably successful. Most distributed applications built today use an RPC runtime such as gRPC [3] or Apache Thrift [2]. The key behind RPC's success is the simple but powerful semantics of its programming model. In particular, RPC has no shared state: arguments and return values are passed by value between processes, meaning that they must be copied into the request or reply. Thus, arguments and return values are inherently immutable. These simple semantics facilitate highly efficient and reliable implementations, as no distributed coordination is required, while remaining useful for a general set of distributed applications. The generality of RPC also enables interoperability: any application that speaks RPC can communicate with another application that understands RPC.
Stephanie Wang, Benjamin Hindman, Ion Stoica
HotOS2
2021 Ownership: A Distributed Futures System for Fine-Grained Tasks
Stephanie Wang, Eric Liang, Edward Oakes, Benjamin Hindman, Sifei Luan 0001, Audrey Cheng, Ion Stoica
NSDI4
2011 Dominant Resource Fairness: Fair Allocation of Multiple Resource Types
Ali Ghodsi 0002, Matei Zaharia, Benjamin Hindman, Andy Konwinski, Scott Shenker, Ion Stoica
NSDI3
2011 Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center
Benjamin Hindman, Andy Konwinski, Matei Zaharia, Ali Ghodsi 0002, Anthony D. Joseph, Randy H. Katz, Scott Shenker, Ion Stoica
NSDI1
2010 Composing parallel software efficiently with lithe
abstract
Applications composed of multiple parallel libraries perform poorly when those libraries interfere with one another by obliviously using the same physical cores, leading to destructive resource oversubscription. This paper presents the design and implementation of Lithe, a low-level substrate that provides the basic primitives and a standard interface for composing parallel codes efficiently. Lithe can be inserted underneath the runtimes of legacy parallel libraries to provide bolt-on composability without needing to change existing application code. Lithe can also serve as the foundation for building new parallel abstractions and libraries that automatically interoperate with one another.
Heidi Pan, Benjamin Hindman, Krste Asanovic
PLDI2