1;3409;0c
University of Washington
Stefan Savage, Michael Burrows, Greg Nelson, Patrick Sobalvarro, Thomas E. Anderson
ACM Transactions on Computer Systems, vol. 15,no. 4,1997 – TOCS
Multithreaded programming is difficult and error prone. It is easy to make a mistake in synchronization that produces a data race, yet it can be extremely hard to locate this mistake during debugging. This article describes a new tool, called Eraser, ...
Robert Wahbe, Steven Lucco, Thomas E. Anderson, Susan L. Graham
ACM SIGOPS Operating Systems Review, vol. 27,no. 5,1993 – SIGOPS
One way to provide fault isolation among cooperating software modules is to place each in its own address space. However, for tightly-coupled modules, this solution incurs prohibitive context switch overhead. In this paper, we present a software ...
Robert Wahbe, Steven Lucco, Thomas E. Anderson, Susan L. Graham
Fourteenth ACM symposium on Operating systems principles, SOSP 1993, 1993 – SOSP
One way to provide fault isolation among cooperating software modules is to place each in its own address space. However, for tightly-coupled modules, this solution incurs prohibitive context switch overhead. In this paper, we present a software ...
IEEE Transactions on Parallel and Distributed Systems, vol. 1,no. 1,1990 – TPDS
The author examines the questions of whether there are efficient algorithms for software spin-waiting given hardware support for atomic instructions, or whether more complex kinds of hardware support are needed for performance. He considers the ...
Thomas E. Anderson, David E. Culler, David A. Patterson, and the NOW team
IEEE Micro, vol. 15,no. 1,1995 – MM
In this paper, we argue that because of recent technology advances, networks of workstations (NOWs) are poised to become the primary computing infrastructure for science and engineering, from low end interactive computing to demanding sequential and ...
B.N. Bershad, Thomas E. Anderson, Edward D. Lazowska, Henry M. Levy
ACM Transactions on Computer Systems, vol. 8,no. 1,1990 – TOCS
Lightweight Remote Procedure Call (LRPC) is a communication facility designed and optimized for communication between protection domains on the same machine. In contemporary small-kernel operating systems, existing RPC systems incur an unnecessarily ...
Thomas E. Anderson, Michael Dahlin, Jeanna M. Neefe, David A. Patterson, Drew S. Roselli, Randolph Y. Wang
ACM SIGOPS Operating Systems Review, vol. 29,no. 5,1995 – SIGOPS
In this paper, we propose a new paradigm for network file system design, serverless network ,file systems. While traditional netwc~rk file systems rely on a central server machine, a serverless system utilizes workstations cooperating as peers to ...
Thomas E. Anderson, Henry M. Levy, B.N. Bershad, Edward D. Lazowska
ACM SIGARCH Computer Architecture News, vol. 19,no. 2,1991 – CAN
Today’s high-performance RISC microprocessors have been highly tuned for integer and floating point application performance. These architectures have paid less attention to operating system requirements. At the same time, new operating system ...
Stefan Savage, Andy Collins, Eric Hoffman, John Snell, Thomas E. Anderson
ACM SIGCOMM Computer Communication Review, vol. 29,no. 4,1999 – CCR
The path taken by a packet traveling across the Internet depends on a large number of factors, including routing protocols and per-network routing policies. The impact of these factors on the end-to-end performance experienced by users is poorly ...
Thomas E. Anderson, B.N. Bershad, Edward D. Lazowska, Henry M. Levy
ACM Transactions on Computer Systems, vol. 10,no. 1,1992 – TOCS
Threads are the vehicle for concurrency in many approaches to parallel programming. Threads can be supported either by the operating system kernel or by user-level library code in the application address space, but neither approach has been fully ...