Mike Burrows, Ulfar Erlingson, Mark T. Vandevoorde, Carl A. Waldspurger, Kevin Walker, ...
This paper presents novel sampling-based techniques for collecting statistical profiles of register contents, data values, and other information associated with instructions, such as memory...
Joel F. Bartlett, Lawrence S. Brakmo, Keith I. Farkas, William R. Hamburgen, Timothy Mann, Marc A. Viredaz, ...
The Itsy pocket computer is a powerful information device small enough to be comfortably worn or carried. It was created to support research in user interfaces and applications. A 32-bit, 200MHz...
Jennifer M. Anderson, Lance M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika R. Henzinger, ...
This paper describes the DIGITAL Continuous Profiling Infrastructure, a sampling-based profiling system designed to run continuously on production systems. The system supports multiprocessors, works...
Memory Resource Management in VMware ESX Server (2002)
VMware ESX Server is a thin software layer designed to multiplex hardware resources efficiently among virtual machines running unmodified commodity operating systems. This paper introduces several...
Experience with Acore: Implementing GHC with Actors (2002)
Jeff Palmucci, Carl A. Waldspurger, David Duis
This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the Laboratory's artificial intelligence research is provided...
Jeff Palmucci, Carl A. Waldspurger, David Duis
This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the Laboratory's artificial intelligence research is provided...
Lottery Scheduling: Flexible Proportional-Share Resource Management (2001)
Carl A. Waldspurger, William E. Weihl
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations....
Carl A. Waldspurger, William E. Weihl
This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to...
The Itsy Pocket Computer (2000)
Joel F. Bartlett, Lawrence S. Brakmo, Keith I. Farkas, William R. Hamburgen, Timothy Mann, Marc A. Viredaz, ...
The Itsy pocket computer is a powerful information device small enough to be comfortably worn or carried. It was created to support research in user interfaces and applications. A 32-bit, 200MHz...
Efficient and Flexible Value Sampling (2000)
Mike Burrows, Ulfar Erlingson, Mark T. Vandevoorde, Carl A. Waldspurger, Kevin Walker, ...
This paper presents novel sampling-based techniques for collecting statistical profiles of register contents, data values, and other information associated with instructions, such as memory...
Carl A. Waldspurger, William E. Weihl, Stride Scheduling, Deterministic Proportionalshare, Winter Mash Retreat
ransport Working Group, January 1996. RFC-1889. [126] Puneet Sharma, Deborah Estrin, Sally Floyd, and Van Jacobson. Scalable Timers for Soft State Protocols. In Proceedings IEEE Infocom '97, Kobe,...
Lottery Scheduling: Flexible Proportional-Share Resource Management (2000)
Carl A. Waldspurger, William E. Weihl
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations....
Continuous Profiling: Where Have All the Cycles Gone? (1999)
Jennifer M. Anderson, Lance M. Berc, Jeffrey Dean, Monika R. Henzinger, L. Sites, ...
This article describes the Digital Continuous Profiling Infrastructure, a sampling-based profiling system designed to run continuously on production systems. The system supports multiprocessors,...
Transparent, Low-Overhead Profiling on Modern Processors (1999)
Jennifer Anderson, Lance Berc, George Chrysos, Jeffrey Dean, Sanjay Ghemawat, Jamey Hicks, ...
ProfileMe, which can provide significant insight into the behavior of programs running on complex microprocessors (especially out-of-order processors) [2]. ProfileMe requires only modest hardware...
Lottery Scheduling: Flexible Proportional-Share Resource Management (1999)
Carl A. Waldspurger, William E. Weihl
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations....
Lottery Scheduling: Flexible Proportional-Share Resource Management (1998)
Carl A. Waldspurger, William E. Weihl
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations....
Experience with Acore: Implementing GHC with Actors. (1998)
Paumucci, Jeff, Waldspurger, Carl A., Duis, David, Krause, Paul
This paper presents a concurrent interpreter for the programming language Guarded Horn Clauses, abbreviated GHC. GHC is a general purpose concurrent logic programming language. It has a clean, simple...
Preventing Recursion Deadlock in Concurrent Object-Oriented Systems, (1998)
Brewer, Eric A., Waldspurger, Carl A.
This paper presents solutions to the problem of deadlock due to recursion in concurrent object-oriented programming languages. Two language-independent, system-level mechanisms for solving this...
Transparent, Low-Overhead Profiling on Modern Processors (1998)
Jennifer Anderson, Lance Berc, George Chrysos, Jeffrey Dean, Sanjay Ghemawat, Jamey Hicks, ...
79> ProfileMe, which can provide significant insight into the behavior of programs running on complex microprocessors (especially out-of-order processors) [2]. ProfileMe requires only modest hardware...
Transparent, Low-Overhead Profiling on Modern Processors (1998)
Jennifer Anderson, Lance Berc, George Chrysos, Jeffrey Dean, Sanjay Ghemawat, Jamey Hicks, ...
79> ProfileMe, which can provide significant insight into the behavior of programs running on complex microprocessors (especially out-of-order processors) [2]. ProfileMe requires only modest hardware...
Lottery Scheduling: Flexible Proportional-Share Resource Management (1998)
Carl A. Waldspurger, William E. Weihl
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations....
Lottery Scheduling: Flexible Proportional-Share Resource Management (1998)
Carl A. Waldspurger, William E. Weihl
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations....
Stride Scheduling: Deterministic Proportional-Share Resource Management (1998)
Carl A. Waldspurger, William E. Weihl
This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to...
Stride Scheduling: Deterministic Proportional-Share Resource Management (1998)
Carl A. Waldspurger, William E. Weihl
This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to...
ProfileMe: Hardware Support for Instruction-Level Profiling on Out-of-Order Processors (1998)
Jeffrey Dean, James E. Hicks, Carl A. Waldspurger, William E. Weihl, George Chrysos
Profile data is valuable for identifying performance bottlenecks and guiding optimizations. Periodic sampling of a processor's performance monitoring hardware is an effective, unobtrusive way to...
ProfileMe: Hardware Support for Instruction-Level Profiling on Out-of-Order Processors (1997)
Jeffrey Dean, James E. Hicks, Carl A. Waldspurger, William E. Weihl, George Chrysos
Profile data is valuable for identifying performance bottlenecks and guiding optimizations. Periodic sampling of a processor's performance monitoring hardware is an effective, unobtrusive way to...
ProfileMe: Hardware Support for Instruction-Level Profiling on Out-of-Order Processors (1997)
Jeffrey Dean, James E. Hicks, Carl A. Waldspurger, William E. Weihl, George Chrysos
Profile data is valuable for identifying performance bottlenecks and guiding optimizations. Periodic sampling of a processor's performance monitoring hardware is an effective, unobtrusive way to...
ProfileMe: Hardware Support for Instruction-Level Profiling on Out-of-Order Processors (1997)
Jeffrey Dean, James E. Hicks, Carl A. Waldspurger, William E. Weihl, George Chrysos
Profile data is valuable for identifying performance bottlenecks and guiding optimizations. Periodic sampling of a processor's performance monitoring hardware is an effective, unobtrusive way to...
Lottery Scheduling: Flexible Proportional-Share Resource Management (1997)
Carl A. Waldspurger, William E. Weihl
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations....
Continuous Profiling: Where Have All the Cycles Gone? (1997)
Jennifer M. Anderson, Lance M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika R. Henzinger, ...
This paper describes the DIGITAL Continuous Profiling Infrastructure, a sampling-based profiling system designed to run continuously on production systems. The system supports multiprocessors, works...
Continuous Profiling: Where Have All the Cycles Gone? (1997)
Jennifer M. Anderson, Lance M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika R. Henzinger, ...
This paper describes the DIGITAL Continuous Profiling Infrastructure, a sampling-based profiling system designed to run continuously on production systems. The system supports multiprocessors, works...
Jennifer M. Anderson, Lance M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika R. Henzinger, ...
This paper describes the DIGITAL Continuous Profiling Infrastructure, a sampling-based profiling system designed to run continuously on production systems. The system supports multiprocessors, works...
Continuous Profiling: Where Have All the Cycles Gone? (1997)
Jennifer M. Anderson, Lance M. Berc, Jeffrey Dean, Sanjay Ghemawat, Monika R. Henzinger, ...
This paper describes the DIGITAL Continuous Profiling Infrastructure, a sampling-based profiling system designed to run continuously on production systems. The system supports multiprocessors, works...
Stride Scheduling: Deterministic Proportional-Share Resource Management (1997)
Carl A. Waldspurger, William E. Weihl
This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to...
This thesis presents flexible abstractions for specifying resource management policies, together with efficient mechanisms for implementing those abstractions. Several novel scheduling techniques are...
This thesis presents flexible abstractions for specifying resource management policies, together with efficient mechanisms for implementing those abstractions. Several novel scheduling techniques are...
Register Relocation: Flexible Contexts for Multithreading (1996)
Carl A. Waldspurger, William E. Weihl
Multithreading is an important technique that improves processor utilization by allowing computation to be overlapped with the long latency operations that commonly occur in multiprocessor systems....
Lottery Scheduling: Flexible Proportional-Share Resource Management (1996)
Carl A. Waldspurger, William E. Weihl
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations....
Stride Scheduling: Deterministic Proportional-Share Resource Management (1996)
Carl A. Waldspurger, William E. Weihl
This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to...
An Object-Oriented Framework for Modular Resource Management (1996)
Carl A. Waldspurger, William E. Weihl
We present a flexible object-oriented framework for specifying modular resource management policies in concurrent systems. The framework generalizes the basic abstractions we originally developed for...
Stride Scheduling: Deterministic Proportional-Share Resource Management (1996)
Carl A. Waldspurger, William E. Weihl
This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to...
Lottery Scheduling: Flexible Proportional-Share Resource Management (1996)
Carl A. Waldspurger, William E. Weihl
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations....
An Object-Oriented Framework for Modular Resource Management (1996)
Carl A. Waldspurger, William E. Weihl
We present a flexible object-oriented framework for specifying modular resource management policies in concurrent systems. The framework generalizes the basic abstractions we originally developed for...
Lottery Scheduling: Flexible Proportional-Share Resource Management (1996)
Carl A. Waldspurger, William E. Weihl
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations....
Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management (1996)
This thesis presents flexible abstractions for specifying resource management policies, together with efficient mechanisms for implementing those abstractions. Several novel scheduling techniques are...
Stride Scheduling: Deterministic Proportional-Share Resource Management (1996)
Carl A. Waldspurger, William E. Weihl
This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to...
Preventing Recursion Deadlock in Concurrent Object-Oriented Systems (1996)
Eric A. Brewer, Carl A. Waldspurger
This paper presents solutions to the problem of deadlock due to recursion in concurrent objectoriented programming languages. Two language-independent, system-level mechanisms for solving this...
Preventing Recursion Deadlock in Concurrent Object-Oriented Systems (1996)
Eric A. Brewer, Carl A. Waldspurger
This paper presents solutions to the problem of deadlock due to recursion in concurrent objectoriented programming languages. Two language-independent, system-level mechanisms for solving this...
An Object-Oriented Framework for Modular Resource Management (1996)
Carl A. Waldspurger, William E. Weihl
We present a flexible object-oriented framework for specifying modular resource management policies in concurrent systems. The framework generalizes the basic abstractions we originally developed for...
Register Relocation: Flexible Contexts for Multithreading (1996)
Carl A. Waldspurger, William E. Weihl
Multithreading is an important technique that improves processor utilization by allowing computation to be overlapped with the long latency operations that commonly occur in multiprocessor systems....
Preventing Recursion Deadlock in Concurrent Object-Oriented Systems (1996)
Eric A. Brewer, Carl A. Waldspurger
This paper presents solutions to the problem of deadlock due to recursion in concurrent objectoriented programming languages. Two language-independent, system-level mechanisms for solving this...
This thesis presents flexible abstractions for specifying resource management policies, together with efficient mechanisms for implementing those abstractions. Several novel scheduling techniques are...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Cover title.
Lottery and stride scheduling : flexible proportional-share resource management (1995)
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Lottery and stride scheduling : flexible proportional-share resource management (1995)
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
Lottery Scheduling: Flexible Proportional-Share Resource Management (1994)
Carl A. Waldspurger, William E. Weihl
This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations....
A distributed computational economy for utilizing idle resources (1989)
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.
A distributed computational economy for utilizing idle resources /--by Carl A. Waldspurger. (1989)
Supervised by Carl E. Hewitt.
A distributed computational economy for utilizing idle resources (1989)
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.
Stride Scheduling: Deterministic Proportional-Share Resource Management (1970)
Carl A. Waldspurger, William E. Weihl
This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to...