W
William E. Weihl
Researcher at Massachusetts Institute of Technology
Publications - 91
Citations - 6794
William E. Weihl is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Serializability & Concurrency. The author has an hindex of 43, co-authored 90 publications receiving 6690 citations. Previous affiliations of William E. Weihl include Hewlett-Packard.
Papers
More filters
Proceedings ArticleDOI
Lottery scheduling: flexible proportional-share resource management
TL;DR: A prototype lottery scheduler for the Mach 3.0 microkernel is implemented, and it is found that it provides flexible and responsive control over the relative execution rates of a wide range of applications.
Journal ArticleDOI
Continuous profiling: where have all the cycles gone?
Jennifer M. Anderson,Lance M. Berc,Jeffrey Dean,Sanjay Ghemawat,Monika Henzinger,Shun-Tak Albert Leung,Richard L. Sites,Mark T. Vandevoorde,Carl A. Waldspurger,William E. Weihl +9 more
TL;DR: The Digital Continuous Profiling Infrastructure is a sampling-based profiling system designed to run continuously on production systems, supporting multiprocessors, works on unmodified executables, and collects profiles for entire systems, including user programs, shared libraries, and the operating system kernel.
Journal ArticleDOI
Reaching approximate agreement in the presence of faults
TL;DR: In this paper, a variant of the Byzantine Generals problem is considered, in which processes start with arbitrary real values rather than Boolean values or values from some bounded range, and in which approximate, rather than exact, agreement is the desired goal.
Proceedings ArticleDOI
ProfileMe: hardware support for instruction-level profiling on out-of-order processors
TL;DR: An inexpensive hardware implementation of ProfileMe is described, a variety of software techniques to extract useful profile information from the hardware are outlined, and several ways in which this information can provide valuable feedback for programmers and optimizers are explained.
Journal ArticleDOI
Commutativity-based concurrency control for abstract data types
TL;DR: Two novel concurrency control algorithms for abstract data types are presented and it is proved that both algorithms ensure a local atomicity property called dynamic atomicity, which means that they can be used in combination with any other algorithms that also ensureynamic atomicity.