| Edgecomputing: extending enterprise applications to the edge of the internet | 43 | 2.44 | 2004 |
| Beyond content delivery: applications to the edge | 0 | 0.34 | 2004 |
| When does a correct mutual exclusion algorithm guarantee mutal exclusion? | 2 | 0.39 | 2000 |
| SIGOPS 2000 Annual Report | 0 | 0.34 | 2000 |
| Dynamic Coscheduling on Workstation Clusters | 74 | 3.26 | 1998 |
| ProfileMe: hardware support for instruction-level profiling on out-of-order processors | 140 | 19.96 | 1997 |
| Continuous profiling: where have all the cycles gone? | 255 | 66.94 | 1997 |
| Dynamic computation migration in DSM systems | 8 | 1.08 | 1996 |
| Scalable concurrent B-trees using multi-version memory | 1 | 0.36 | 1996 |
| Algorithms for Search Trees on Message-Passing Architectures | 3 | 0.52 | 1996 |
| Reducing synchronization overhead in parallel simulation | 23 | 1.67 | 1996 |
| Zippers: A Focus+Context Display of Web Pages | 5 | 1.04 | 1996 |
| Demand-Based Coscheduling of Parallel Jobs on Multiprogrammed Multiprocessors | 59 | 4.70 | 1995 |
| Optimistic active messages: a mechanism for scheduling communication with computation | 40 | 6.62 | 1995 |
| Deriving global virtual time algorithms from conservative simulation protocols | 1 | 0.48 | 1995 |
| Specification and Verification of Object-Oriented Programs Using Supertype Abstraction. | 41 | 2.67 | 1995 |
| Software prefetching and caching for translation lookaside buffers | 31 | 6.82 | 1994 |
| Lottery scheduling: flexible proportional-share resource management | 316 | 65.74 | 1994 |
| Optimistic active messages: structuring systems for high-performance communication | 2 | 0.72 | 1994 |
| Register relocation: flexible contexts for multithreading | 27 | 1.75 | 1993 |
| Performance assertion checking | 28 | 2.44 | 1993 |
| The impact of recovery on concurrency control | 52 | 42.32 | 1993 |
| Atomic incremental garbage collection and recovery for a large stable heap | 34 | 34.32 | 1993 |
| Computation migration: enhancing locality for distributed-memory parallel systems | 30 | 4.22 | 1993 |
| PROTEUS: a high-performance parallel-architecture simulator | 167 | 49.34 | 1992 |
| Hybrid Atomicity for Nested Transactions | 8 | 10.32 | 1992 |
| Atomic Garbage Collection | 2 | 1.28 | 1992 |
| PRELUDE: A System for Portable Parallel Software | 13 | 6.43 | 1992 |
| Pipes: linguistic support for ordered asynchronous invocations | 1 | 0.36 | 1992 |
| A Case Study of CES: A Distributed Collaborative Editing System Implemented in Argus | 17 | 3.06 | 1992 |
| On the correctness of orphan management algorithms | 5 | 1.34 | 1992 |
| Prelude: Tools for Building Portable Parallel Programs (Abstract) | 0 | 0.34 | 1992 |
| Scalable Reader-Writer Locks for Parallel Systems | 12 | 1.77 | 1992 |
| An Algorithm for Concurrent Search Trees | 11 | 6.90 | 1991 |
| Hybrid concurrency control for abstract data types | 60 | 32.63 | 1991 |
| A serialization graph construction for nested transactions | 26 | 12.20 | 1990 |
| Fault-tolerant parallel computing | 0 | 0.34 | 1990 |
| Multi-version memory: software cache management for concurrent B-trees | 14 | 4.87 | 1990 |
| Reasoning about object-oriented programs that use subtypes | 40 | 9.78 | 1990 |
| Commutativity-based locking for nested transactions | 31 | 13.03 | 1990 |
| Local atomicity properties: modular concurrency control for abstract data types | 100 | 38.17 | 1989 |
| Two phase gossip: managing distributed event histories | 24 | 21.40 | 1989 |
| Atomic garbage collection: managing a stable heap | 17 | 4.45 | 1989 |
| A theory of atomic transactions | 17 | 14.29 | 1988 |
| A Theory of Timestamp-Based Concurrency Control for Nested Transactions | 21 | 16.57 | 1988 |
| Commutativity-Based Concurrency Control for Abstract Data Types | 160 | 49.70 | 1988 |
| Distributed Version Management for Read-Only Actions | 53 | 20.32 | 1987 |
| Nested transactions and read-write locking | 29 | 32.00 | 1987 |
| Atomic data abstractions in a distributed collaborative editing system | 37 | 65.29 | 1986 |
| Specifications of Distributed Programs | 11 | 2.72 | 1986 |
