Benjamin Hindman

University of California, Berkeley | UCB · Department of Electrical Engineering and Computer Sciences

Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We present a new job execution environment Flextic that exploits scalable static scheduling techniques ...

We consider the problem of fair resource allocation in a system containing different resource types, where each user may have different demands for each resource. To address this problem, we propose Dominant Resource Fairness (DRF), a generalization of max-min fairness to multiple resource types. We show that DRF, unlike other possible policies, sa...

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 inter...

The success of MapReduce has sparked many efforts to design cluster computing frameworks. We argue that no single framework will be optimal for all ap-plications, and that we should instead enable organi-zations to run multiple frameworks efficiently in the same cloud. Furthermore, to ease development of new frameworks, it is critical to identify c...

For the software industry to take advantage of multicore processors, we must allow programmers to arbitrarily compose parallel libraries without sacrificing performance. We argue that high-level task or thread abstractions and a common global scheduler cannot provide effective library composition. Instead, the operating system should expose unvirtu...

We present an implementation and evaluation of atomicity (also known as software transactions) for a dialect of Java. Our implementation is fundamentally different from prior work in three respects: (1) It is entirely a source-to-source translation, producing Java source code that can be compiled by any Java compiler and run on any Java Virtual Mac...

We present an implementation and evaluation of atomic- ity (also known as software transactions) for a dialect of Java. Our implementation is fundamentally dierent from prior work in three respects: (1) It is entirely a source-to- source transformation, producing Java source code that can be compiled by any Java compiler and run on any Java Vir- tu...