Professor Tom reviews the research
literature with a new student.

                                                Tom Anderson

                                                                         Dept. of Computer Science and Engineering
                                                                         University of Washington
                                                                         646 Allen Center

                                                                         Seattle, WA 98195
                                                                         (206) 543-9348; fax: (206) 616-3804
                                                                         email: tom (at) cs.washington.edu

                                                                         Research Coordinator:  Melody Kadenko 

                                                                         email: melody (at) cs.washington.edu

                                                                         (206) 616-1068

Overview

My research concerns the practical issues in constructing robust, secure, and efficient computer systems.  I see myself as a generalist -- I am attracted to biggest problem I can find, regardless of area.  Most recently I have been working on networking issues, where the unsolved problems are numerous, tangled, and highly relevant.  I've also done research in operating systems, local and wide area distributed systems, software engineering, system security, local and network file systems, computer architecture, and educational software. I haven't written a database, AI, or graphics paper yet, but give me time!  Specific projects I've worked on include multiprocessor OS scheduler activations, lightweight remote procedure call (LRPC), DEC SRC's AN2 (one of the earliest gigabit LAN switches), software-based fault isolation, the MemSpy system for tuning memory system performance, the Berkeley Network of Workstations (NOW) clusters project, the xFS scalable distributed file system, the IRAM project integrating DRAM and logic on a single chip, the Eraser tool for finding race conditions in concurrent programs, WebOS system support for wide area applications, one.world system support for pervasive applications, the Active Names system for extensible Internet protocols, the Detour project for intelligent overlay routing, the Rocketfuel project for efficiently mapping the Internet, the worldwide Planetlab networking and distributed systems research testbed, extensible Internet measurement with Scriptroute, and the WaveScalar project to design a scalable computer architecture.  I also helped design Nachos, a popular project for teaching undergraduate operating systems, and I am working on a related project called Fishnet for teaching undergraduate networking with a network of ad hoc wireless devices. 

My current research project is called RIP (Re-architecting the Internet Protocols), a collaborative effort with my colleague David Wetherall and our students Andy Collins, Ankur Jain, Ratul Mahajan, Stavan Parikh, Maya Rodrig, Neil Spring, and Gang Zhao.  While the Internet has been an astounding engineering triumph, it faces huge technical problems.  As just one example, worldwide spending on cleaning up after viruses, worms, and spam -- that is, spending on coping with the consequences of connecting to the Internet -- is much larger than the worldwide spending on Internet connectivity itself.  The Internet itself is fragile, insecure, and poorly optimized.  Our research is to fix the myriad problems with the Internet by re-thinking its design from first principles, to help the Internet realize its potential for revolutionizing communication in our society.  RIP involves four inter-related projects:

Reverse engineering the Internet.  Remarkably, there is very little quantitative data about the Internet's behavior.  In large part, this is because the Internet is operated by a loose federation of tens of thousands of organizations, at turns both competing and cooperating with each other to provide Internet service to end users.  Almost all Internet service providers consider details of their internal operation to be confidential.  To provide a robust understanding of how the Internet really behaves, we are undertaking a project to systematically measure every aspect of the Internet's behavior, from topology and provisioning, to intra- and inter-domain routing policies, to failures and mis-configurations, to workload.  A key insight is to leverage and integrate the various sources of information that leak out from service about their internal operation, in much the same way that astronomers infer stellar structure from the evidence which reaches our telescopes.  See here for a manifesto outlining the opportunity and research challenges to Internet reverse engineering.  We have written several papers sketching initial results in this area, including the first study to accurately measure backbone network topologies and the first study to infer internal routing and peering policy of service providers.  We have also built several tools to aid our effort, including Scriptroute, an extensible and secure tool for making Internet measurements, tulip, a new tool using advanced measurement techniques to diagnose end-to-end Internet performance problems, and an ongoing effort to produce more accurate sample topology and workload generators for network research.

Robust and secure protocols.  The Internet is at times amazingly robust and at times incredibly fragile.  Faced with multiple simultaneous hardware failures, the Internet will (more or less quickly) re-organize itself to reestablish connectivity.  But the Internet is not equally robust to software errors and mis-configurations.  Even without malicious attack, small errors have repeatedly cascaded to cause massive disruptions in Internet service.  As a first step, we conducted a survey of major failures in the Internet over the past twenty years; since most of the failures were due to weaknesses in protocol design, we outline some guidelines for how we might design protocols to void similar events in the future.  We have also produced several specific protocols, including one to prevent receivers from cheating congestion control limits and another to completely eliminate the potential for denial-of-service attacks.  We are also looking at provably robust protocols for wide area routing and wireless media access.

Effective management of Internet resources.  Popular mythology is that Internet bandwidth is getting exponentially cheaper each year, and soon will be essentially free.  Indeed, it almost is -- it costs a penny to send a 10MB file across the Internet.  So there's no need to carefully manage resources, right?  The truth is more complex: computing is becoming cheaper at a much faster rate than networking bandwidth, in large part because computing equipment is a much higher volume business than wide area networking gear, and therefore can leverage enormous economies of scale.  For comparison, that same penny will buy you 100 giga-ops of computing!  More importantly, the curves are diverging over time, and we believe this will long term trend will radically alter the Internet's architecture.  Indeed it has already -- the Internet illuminati rail against middleboxes, as violating the Internet's end-to-end architecture, yet firewalls, load balancers, and NATs are just the tip of the iceberg.  How should we architect the Internet for a world where computing is free, networks are cheap, and people are expensive?  We would build a system that is self-managing, is optimized for end-user performance, and uses computing throughout to get more efficient use out of networking hardware.  This vision underlies our efforts in network management, radical congestion control architectures, provably stable adaptive routing algorithms, wide-area link compression protocols, aggressive caching and pre-fetching algorithms, etc.

Extensibility.   Of course, all this is academic if we can't figure out a way to change the Internet.  We are a founding member of PlanetLab, a worldwide network of computers for developing and deploying new protocols and distributed services.  The Scriptroute extensible network measurement facility was one of the first services to be deployed on PlanetLab.  Part of our vision is to smooth the path from research idea to validation, by building better tools for generating Internet-like topologies and workloads, to faster parallel simulation frameworks, to scalable emulation, to deployment on PlanetLab.  At same time, we have also focused on making protocols themselves easier to extend, starting with my colleague David Wetherall's Active Networks work, to the Active Names system for leveraging naming as the point of indirection for introducing new protocols, to our more recent work building a TCP stack that can be safely extended from either endpoint.

We draw inspiration for the RIP project from another architecture project, Taliesin West.  This building was designed and built by Frank Lloyd Wright and his students for their own use, out of materials found in the local area, to exist in harmony with its desert setting.  Many of the ideas in RIP are likewise from our students, using the building blocks we have at our disposal, and designed to draw strength from rather than oppose the trends in the Internet's underlying technologies and use.

One of the great things about doing computer science research for a living is that you get to work with really smart people, and you get to learn a lot at the same time.  Both at Washington (where I was a graduate student) and Berkeley (where I taught in the early 90's), and now back again at Washington (where I returned for the weather), I've benefited from a stellar group of colleagues and students, full of energy, insight and fresh ideas. Almost all the results we've had together are really due to them.  My students in particular have been inspiring to work with (in addition to the RIP students listed above):  Mike Dahlin (UT-Austin),  Doug Ghormley (Sandia), Margaret Martonosi (Princeton), Jeanna Neefe Matthews (Clarkson), Drew Roselli (Microsoft), Stefan Savage (UCSD), Amin Vahdat (UCSD via Duke), and Randy Wang (Princeton).  A test of a good advisor is how well their students do after they fly the coop: three of my students have recently received tenure, three have won the prestigious Sloan Research Fellowship, two have won department teaching awards, and collectively, they've co-authored four award papers.  I've also had great fun working with other people's students, including my brother Eric Anderson (now at Google), Remzi and Andrea Arpaci-Dusseau (Wisconsin), Robert Grimm (NYU), Arvind Krishnamurthy (Yale), Dennis Lee (Amazon), Rich Martin (Rutgers), Steve Lucco (MSR), Nick McKeown (Stanford), and Robert Wahbe (Microsoft), to name a few.  Not to mention the great colleagues with whom I've worked, most recently David Culler,  Larry Peterson, Timothy Roscoe, Ion Stoica, Scott Shenker, and  David Wetherall.  I studied philosophy as an undergraduate, and so I am perhaps the only person in the world who can claim that both John Rawls and Ed Lazowska were on their thesis committee, although not at the same time!

Instructional Materials

Nachos: Instructional software for undergraduate and graduate operating systems courses

Undergraduate operating systems course lectures and assignments and translated into Spanish

A quick introduction to C++

Undergraduate networking course lectures and assignments

Graduate networking course lectures and assignments, in two versions, one for PhD students and one for professional MS students

Graduate distributed systems course lectures and assignments

Education

Awards

Award Papers

Publications

Network Architecture

Tom Anderson, Timothy Roscoe, and David Wetherall. Preventing Internet Denial-of-Service with Capabilities. Proc. Second ACM SIGCOMM HotNets Workshop, November 2003.

Larry Peterson, Tom Anderson, David Culler, Timothy Roscoe.  A Blueprint for Introducing Disruptive Change in the Internet. Proc. First ACM SIGCOMM HotNets Workshop, October 2002.  

Tom Anderson, Scott Shenker, Ion Stoica, and David Wetherall.  Design Considerations for Robust Internet Protocols.  Proc. First ACM SIGCOMM HotNets Workshop, October 2002.

Stefan Savage, David Wetherall, Anna Karlin, and Tom Anderson.  Network Support for IP Traceback.  IEEE/ACM Transactions on Networking, June 2001.  Also appeared in ACM SIGCOMM 2000, September 2000.

Stefan Savage, Neal Cardwell and Tom Anderson.  The Case for Informed Transport Protocols.  Proc. Seventh HotOS, March 1999.

Stefan Savage, Tom Anderson, Amit Aggarwal, David Becker, Neal Cardwell, Andy Collins, Eric Hoffman, John Snell, Amin Vahdat, Geoff Voelker, and John Zahorjan.  Detour: Informed Internet Routing and Transport.  IEEE Micro, February 1999.  Also appeared as an Award Paper at Proc. Hot Interconnects VI, August 1998.

Nick McKeown and Tom Anderson.  A Quantitative Comparison of Scheduling Algorithms for Input-Queued Switches.  Computer Networks and ISDN Systems, Elsevier Science Publishing, 1998.

Tom Anderson, Sue Owicki, Jim Saxe, and Chuck Thacker.  High Speed Switch Scheduling for Local Area Networks.  ACM Transactions on Computer Systems, November 1993.  Also appeared as an Award Paper at Proc. ASPLOS V, October 1992.

Network Measurement

Neil Spring, David Wetherall, and Tom Anderson. Reverse-Engineering the Internet. Proc. First ACM SIGCOMM HotNets Workshop, October 2002.

Ratul Mahajan, Neil Spring, David Wetherall and Tom Anderson. User-level Internet Path Diagnosis. Proc. Nineteenth ACM Symposium on Operating Systems Principles (SOSP), October 2003.

Neil Spring, Ratul Mahajan, David Wetherall, and Tom Anderson.  Measuring ISP Topologies with Rocketfuel.  To appear, IEEE/ACM Transactions on Networking, 2003.

Neil Spring, Ratul Mahajan, and Tom Anderson.  Quantifying the Causes of Path Inflation.  Proc. ACM SIGCOMM 2003, August 2003.

Neil Spring, David Wetherall, and Tom Anderson.  Scriptroute: A Facility for Distributed Internet Measurement.  Award paper at Proc. Fourth USENIX Symposium on Internet Technologies and Systems (USITS), March 2003.

Ratul Mahajan, Neil Spring, David Wetherall, and Tom Anderson.  Inferring Link Weights Using End-to-End Measurements.  Proc. ACM SIGCOMM Internet Measurement Workshop (IMW) 2002, November 2002.

Ratul Mahajan, David Wetherall, and Tom Anderson.  Understanding BGP Misconfiguration.  Proc. ACM SIGCOMM 2002, August 2002.

Stefan Savage, Andy Collins, Eric Hoffman, John Snell, and Tom Anderson.  The End-to-End Effects of Internet Path Selection.  Proc. ACM SIGCOMM 1999, September 1999.

Routing and Congestion Control

          Eric Anderson and Tom Anderson.  On the Stability of Adaptive Routing in the Presence of Congestion Control.  Proc. IEEE Infocom 2003, April 2003.

David Ely, Neil Spring, David Wetherall, Stefan Savage, and Tom Anderson.  Robust Congestion Signalling.  Proc. Ninth IEEE International Conference on Network Protocols (ICNP), November 2001.

Neal Cardwell, Stefan Savage, and Tom Anderson.  Modeling TCP Latency.  Proc. IEEE Infocom 2000, March 2000.

Amit Aggarwal, Stefan Savage, and Tom Anderson.  Understanding the Performance of TCP Pacing.  Proc. IEEE Infocom 2000, March 2000.

Neil Spring, Maureen Chesire, Mark Berryman, Vivek Sahasranaman, Thomas Anderson, and Brian Bershad.  Receiver Based Management of Low Bandwidth Access Links.  Proc. IEEE Infocom 2000, March 2000.

Stefan Savage, Neal Cardwell, David Wetherall and Tom Anderson.  TCP Congestion Control with a Misbehaving Receiver.  ACM Computer Communications Review (CCR), October 1999.

Pervasive Computing Systems

Robert Grimm, Janet Davis, Eric Lemar, Adam MacBeth, Steve Swanson, Steve Gribble, Tom Anderson, Brian Bershad, Gaetano Borriello, and David Wetherall.  Programming for Pervasive Computing Environments.  UW Technical Report UW-CSE 01-06-01, revised, January 2002.

Robert Grimm, Janet Davis, Eric Lemar, Adam MacBeth, Steve Swanson, Steve Gribble, Tom Anderson, Brian Bershad, Gaetano Borriello, and David Wetherall.  System-Level Programming Abstractions for Ubiquitous Computing.  Proc. UbiTools’01 Workshop, September 2001.

Robert Grimm, Janet Davis, Ben Hendrickson, Eric Lemar, Adam MacBeth, Steve Swanson, Tom Anderson, Brian Bershad, Gaetano Borriello, Steve Gribble, and David Wetherall.  System Directions for Pervasive Computing.  Proc. HotOS 2001, May 2001.

Robert Grimm, Tom Anderson, Brian Bershad, David Wetherall.  A System Architecture for Pervasive Computing.  Proc. Ninth ACM SIGOPS European Workshop, September 2000.

Mike Esler, Jeffrey Hightower, Tom Anderson and Gaetano Borriello.  Next Century Challenges: Data-Centric Networking for Invisible Computing.  Proc. MOBICOM 1999, August 1999.

Wide Area Distributed Systems

Amin Vahdat, Mike Dahlin, Tom Anderson and Amit Aggarwal.  Active Names: Flexible Location and Transport of Wide-Area Resources.  Proc. Second USENIX Symposium on Internet Technologies and Systems (USITS), October 1999.

Amin Vahdat, Tom Anderson, Mike Dahlin, Eshwar Belani, David Culler, Paul Eastham, and Chad Yoshikawa.  WebOS: Operating System Services for Wide Area Applications.  Proc. Seventh International Symposium on High Performance Distributed Computing (HPDC), July 1998.

Eshwar Belani, Amin Vahdat, Tom Anderson, and Mike Dahlin.  CRISIS: A Wide Area Security Architecture.  Proc. Seventh USENIX Security Symposium, January 1998.

Chad Yoshikawa, Brent Chun, Paul Eastham, Amin Vahdat, Tom Anderson, and David Culler.  Using Smart Clients to Build Scalable Services.  Proc. 1997 USENIX Conference, January 1997.

Amin Vahdat, Paul Eastham, and Thomas Anderson. WebFS: A Global Cache Coherent Filesystem.  UC Berkeley Technical Report, December 1996.

Networks of Workstations (Clusters)

Doug Ghormley, David Petrou, Steve Rodrigues, Amin Vahdat, and Tom Anderson.  GLUnix: A Global Layer UNIX for a Network of Workstations.  Software Practice and Experience, vol. 28, no. 9, July 1998.

Randy Wang, Arvind Krishnamurthy, Rich Martin, Tom Anderson, and David Culler.  Modeling and Optimizing Pipeline Latency.  Proc. 1998 ACM SIGMETRICS, June 1998.

Rich Martin, Amin Vahdat, David Culler and Tom Anderson.  Effects of Communication Latency, Overhead and Bandwidth in a Cluster Architecture.  Proc. 24th International Symposium on Computer Architecture (ISCA), June 1997.

Steve Rodrigues, Tom Anderson, and David Culler.  High-Performance Local Area Communication with Fast Sockets.  Proc. 1997 USENIX Conference, January 1997.

Kim Keeton, Tom Anderson, and Dave Patterson.  LogP Quantified: The Case for Low Overhead Local Area Networks.  Proc. 1995 Hot Interconnects III, August 1995.

Remzi Arpaci, Andrea Dusseau, Amin Vahdat, Lok Liu, Tom Anderson, and Dave Patterson.  The Interaction of Parallel and Sequential Workloads on a Network of Workstations. Proc. 1995 ACM SIGMETRICS, May 1995.

Tom Anderson, David Culler, Dave Patterson, and the NOW Team.  A Case for NOW (Networks of Workstations).  IEEE Micro 15, 1, February 1995, pp. 54-64.  Selected as an Award Paper in Proc. 1994 Hot Interconnects II, August 1994. 

Distributed and Local File Systems

Xiang Yu, Benjamin Gum, Yuqun Chen, Randy Wang, Arvind Krishnamurthy, Kai Li, and Tom Anderson.  Trading Capacity for Performance in a Disk Array.  Proc. Fourth Symposium on Operating Systems Design and Implementation (OSDI), October 2000.

Drew Roselli, Jay Lorch, and Tom Anderson.  A Comparison of File System Workloads.  Proc. 2000 USENIX Technical Conference, San Diego, June 2000.

Randy Wang, Tom Anderson, and Dave Patterson.  Virtual Log-Based File Systems for a Programmable Disk.  Proc. Third Symposium on Operating Systems Design and Implementation (OSDI), February 1999.

Randy Wang, Tom Anderson, and Mike Dahlin.  Experience with a Distributed File System Implementation.  Unpublished manuscript, 1998.

Jeanna Neefe Matthews, Drew Roselli, Adam Costello, Randy Wang, and Tom Anderson.  Improving the Performance of Log Structured File Systems with Adaptive Methods.  Proc. Sixteenth ACM Symposium on Operating System Principles (SOSP), October 1997.

Tom Anderson, Mike Dahlin, Jeanna Neefe, Drew Roselli, Dave Patterson, and Randy Wang.  Serverless Network File Systems.  ACM Transactions on Computer Systems 14, 1, February 1996.  Selected as an Award Paper, Proc. Fifteenth ACM Symposium on Operating System Principles (SOSP), December 1995. Also in Hai Jin, Toni Cortes, and Rajkumar Byuua, Ed., High Performance Mass Storage and Parallel I/O: Technologies and Applications, IEEE & Wiley Press, ISBN 0-471-20809-4, New York, USA, 2001.

Mike Dahlin, Tom Anderson, Dave Patterson, and Randy Wang.  Cooperative Caching: Using Remote Client Memory to Improve File System Performance.  Proc. First Symposium on Operating Systems Design and Implementation (OSDI), November 1994, pp. 267-280.

Mike Dahlin, Tom Anderson, Cliff Mather, Dave Patterson and Randy Wang.  A Quantitative Analysis of Cache Policies for Scalable File Systems.  Proc. 1994 ACM SIGMETRICS, May 1994, pp. 150-160.

Kester Li, Roger Kumpf, Paul Horton, and Tom Anderson.  A Quantitative Analysis of Disk Drive Power Management in Portable Computers.  Proc. 1994 Winter USENIX Conference, January 1994.

Randy Wang and Tom Anderson.  xFS: A Wide Area Mass Storage File System.  Proc. Fourth Workshop on Workstation Operating Systems (WWOS), October 1993, pp. 71-78.

Computer Architecture

Dennis Lee, Patrick Crowley, Jean-Loup Baer, Tom Anderson, and Brian Bershad.  Execution Characteristics of Desktop Applications on Windows NT.  Proc. 25th Annual International Symposium on Computer Architecture (ISCA), June 1998.

Christoforos Kozyrakis, Stylianos Perissakis, David Patterson, Thomas Anderson, Krste Asanovic, Neal Cardwell, Richard Fromm, Jason Golbus, Benjamin Gribstad, Kimberly Keeton,  Randi Thomas, Noah Treuhaft, and Katherine Yelick.  Scalable Processors to 1 Billion Transistors and Beyond: IRAM.  IEEE Computer, September 1997.

Richard Fromm, Stylianos Perissakis, Neal Cardwell, Christoforos Kozyrakis, Bruce McGaughy, Dave Patterson, Tom Anderson, and Kathy Yelick.  The Energy Efficiency of IRAM Architectures.  Proc. 24th Annual International Symposium on Computer Architecture (ISCA), June 1997.

Dave Patterson, Tom Anderson, Neal Cardwell, Richard Fromm, Kim Keeton, Christoforos Kozyrakis, Randi Thomas, and Kathy Yelick.  A Case for Intelligent RAM: IRAM.  IEEE Micro, April 1997.  Selected as an Award Paper, Hot Chips VIII, August 1996.

Dave Patterson, Tom Anderson, Neal Cardwell, Richard Fromm, Kim Keeton, Christoforos Kozyrakis, Randi Thomas, and Kathy Yelick.  Intelligent RAM (IRAM): Chips That Remember and Compute.  Proc. 1997 IEEE International Solid-State Circuits Conference (ISSCC), February 1997.

Tom Anderson, Hank Levy, Brian Bershad, and Ed Lazowska.  The Interaction of Architecture and Operating System Design.  Proc. ASPLOS IV, April 1991.

Efficient Fault Isolation

Robert Wahbe, Steve Lucco, Tom Anderson and Sue Graham.  Efficient Software-Based Fault Isolation.  Proc. Fourteenth ACM Symposium on Operating System Principles (SOSP), December 1993.

Curtis Yarvin, Richard Bukowski, and Tom Anderson.  Anonymous RPC: Low Latency Protection in a 64-Bit Address Space.  Selected as Best Student Paper in Proc. 1993 Summer USENIX Conference, June 1993.

Brian Bershad, Tom Anderson, Ed Lazowska and Hank Levy.  User-Level Interprocess Communication for Shared-Memory Multiprocessors.  ACM Transactions on Computer Systems, May 1991.

Brian Bershad, Tom Anderson, Ed Lazowska and Hank Levy.  Lightweight Remote Procedure Call.  ACM Transactions on Computer Systems, February 1990.  Selected as an Award Paper in Proc. Twelfth ACM Symposium on Operating Systems Principles (SOSP), December 1989.

Multiprocessor Operating Systems

Tom Anderson, Brian Bershad, Ed Lazowska, and Hank Levy.  Thread Management for Shared-Memory Multiprocessors.  The Computer Science and Engineering Handbook. Allen Tucker, Ed.  CRC Press. 1997.

Tom Anderson, Brian Bershad, Ed Lazowska and Hank Levy.  Scheduler Activations: Effective Kernel Support for the User-Level Management of Parallelism.  ACM Transactions on Computer Systems, February 1992.  Selected as an Award Paper in Proc. Thirteenth ACM Symposium on Operating Systems Principles (SOSP), October 1991.

  Tom Anderson "Operating System Support for High Performance Multiprocessing."  Ph.D. Thesis, University of Washington.  UW Technical Report 91-08-10, August 1991.

Tom Anderson.  The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors.  IEEE Transactions on Parallel and Distributed Systems 1, 1, January 1990.  An earlier version appeared in Proc. 1989 International Conference on Parallel Processing (ICPP), August 1989.

Tom Anderson, Ed Lazowska, and Hank Levy.  The Performance Implications of Thread Management Alternatives for Shared-Memory Multiprocessors.  IEEE Transactions on Computers, December 1989.  Selected as an Award Paper in Proc. 1989 ACM SIGMETRICS, May 1989.

Operating Systems Misc.

Dennis Lee, Jean-Loup Baer, Brian Bershad, and Tom Anderson.  Reducing Startup Latency in Web and Desktop Applications.  Proc. Third USENIX Windows NT Symposium, June 1999.  

Amin Vahdat and Tom Anderson.  Transparent Result Caching.  Proc. 1998 USENIX Technical Conference, June 1998.

Doug Ghormley, David Petrou, Steve Rodrigues, and Tom Anderson.  SLIC: An Extensibility System for Commodity Operating Systems.  Proc. 1998 USENIX Technical Conference, June 1998.

Keith Krueger, David Loftesness, Amin Vahdat, and Tom Anderson.  Tools for the Development of Application-Specific Virtual Memory Management.  Proc. 1993 Conference on Object Oriented Programming: Systems, Languages, and Applications (OOPSLA), September 1993.

Tom Anderson.  The Case for Application-Specific Operating Systems.  Proc. Third Workshop on Workstation Operating Systems (WWOS), April 1992.

Software Engineering

Stefan Savage, Mike Burrows, Greg Nelson, Patrick Sobalvarro, and Tom Anderson.  Eraser: A Dynamic Data Race Detector for Multi-Threaded Programs.  ACM Transactions on Computer Systems, November 1997.  Selected as an Award Paper in Proc. Sixteenth ACM Symposium on Operating System Principles (SOSP), October 1997.

Satish Chandra, Mike Dahlin, Brad Richards, Randy Wang, Tom Anderson, and Jim Larus.  Experience with a Language for Writing Coherence Protocols.  Proc. USENIX Conference on Domain-Specific Languages, October 1997.

Margaret Martonosi, Anoop Gupta, and Tom Anderson.  Tuning Memory Performance in Sequential and Parallel Programs.  IEEE Computer 28, 4, April 1995.

Margaret Martonosi, Anoop Gupta, and Tom Anderson.  Effectiveness of Trace Sampling for Performance Debugging Tools.  Proc. 1993 ACM SIGMETRICS, May 1993.

Margaret Martonosi, Anoop Gupta, and Tom Anderson.  MemSpy: Analyzing Memory System Bottlenecks in Programs.  Proc. 1992 ACM SIGMETRICS, May 1992.

Tom Anderson and Ed Lazowska.  Quartz: A Tool for Tuning Parallel Program Performance.  Proc. 1990 ACM SIGMETRICS, May 1990.

Education

Tom Anderson.  "The Nachos System."  Appeared as an appendix in, Operating Systems Concepts, 4th Ed., A. Silberschatz and P. Galvin.  Addison-Wesley (November 1993).  An earlier version of this paper appeared as: Wayne Christopher, Steve Procter, and Tom Anderson.  The Nachos Instructional Operating System.  Selected as Best Paper in Proc. 1993 Winter USENIX Conference, January 1993, pp. 479-488.

Graduated Ph.D. Students

Graduated M.S. Students