Improved Approximations for Multiprocessor Scheduling Under Uncertainty (2009)
Christopher Y. Crutchfield, David R. Karger, Zoran Dzunic, Jacob H. Scott, Jeremy T. Fineman
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilistically. This problem...
Contention Resolution with Heterogeneous Job Sizes (2009)
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or failed. We first...
Nested Parallelism in Transactional Memory (2009)
Kunal Agrawal, Jeremy T. Fineman, Jim Sukha
This paper investigates adding transactions with nested parallelism and nested transactions to a dynamically multithreaded parallel programming language that generates only series-parallel programs....
Contention Resolution with Heterogeneous Job Sizes (2009)
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or failed. We first...
The Worst Page-Replacement Policy (2009)
Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman
Abstract. In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of misses as...
Abstract Nested Parallelism in Transactional Memory (2009)
Kunal Agrawal, Jeremy T. Fineman, Jim Sukha
This paper describes XCilk, a runtime-system design for software transactional memory in a Cilk-like parallel programming language, which uses a work-stealing scheduler. XCilk supports transactions...
The Worst Page-Replacement Policy (2008)
Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman
Abstract. In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of misses as...
Contention Resolution with Heterogeneous Job Sizes (2008)
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or failed. We first...
The Worst Page-Replacement Policy (2008)
Kunal Agrawal Kunal, Jeremy T. Fineman
Consider a computer system with a two-level memory hierarchy consisting of a small fast memory of size k and a large slow memory. Memory is divided into fixed-size pages. Each memory access indicates...
The Worst Page-Replacement Policy (2008)
Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman
Abstract. In this paper, we consider the question: what is the worst possible page-replacement strategy? Our goal is to devise an online strategy that has the highest possible fraction of misses as...
Improved Approximations for Multiprocessor Scheduling Under Uncertainty (2008)
Crutchfield, Christopher, Dzunic, Zoran, Fineman, Jeremy T., Karger, David R., Scott, Jacob
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty, or SUU, in which the execution of each job may fail probabilistically. This...
Contention Resolution with Heterogeneous Job Sizes (2008)
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or failed. We first...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two...
Provably good race detection that runs in parallel (2005)
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Provably good race detection that runs in parallel / (2005)
A multithreaded parallel program that is intended to be deterministic may exhibit nondeterminism clue to bugs called determinacy races. A key capability of race detectors is to determine whether one...
Provably good race detection that runs in parallel (2005)
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.
Provably good race detection that runs in parallel (2005)
Jeremy T. Fineman, Charles E. Leiserson, Arthur C. Smith, Jeremy T. Fineman
Provably good race detection that runs in parallel (2005)
Jeremy T. Fineman, Charles E. Leiserson, Arthur C. Smith, Jeremy T. Fineman
On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs (2004)
Bender, Michael A., Fineman, Jeremy T., Gilbert, Seth, Leiserson, Charles E.
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two...
On-the-Fly Maintenance of Series-Parallel Relationships in Fork-Join Multithreaded Programs (2004)
Bender, Michael A., Fineman, Jeremy T., Gilbert, Seth, Leiserson, Charles E.
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two...
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs (2004)
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two...
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs (2004)
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper provides two...
Efficient on the fly maintenance of series-parallel relationships (2003)
A series-parallel directed acyclic graph, or SP-dag, contains nodes that are either in series or logically in parallel. We present a data structure and algorithm to efficiently determine, in a single...
Efficient on the fly maintenance of series-parallel relationships (2003)
A series-parallel directed acyclic graph, or SP-dag, contains nodes that are either in series or logically in parallel. We present a data structure and algorithm to efficiently determine, in a single...