Searching for authors named "Maurice Herlihy" – sorted by Relevance.
-
Abstract Architectural
- A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly con-current systems, lock-free data structures avoid common problems ass
- Add To MetaCart
-
Peer-to-Peer Multiplayer Gaming using Arrow Multicast: Peer-to-Peer Quake
- Most commonly available multiplayer games are based on client server architecture. We think that Peer-to-Peer organization is a promising way to structure multiplayer games and we propose to test whether the Arrow Multicast protocol is a good fit for such a system. We propose a design to make multip
- Add To MetaCart
-
Randomized Wait-Free Concurrent Objects (Extended Abstract)
- A concurrent object is a data structure shared by concurrent processes. A wait-free implementation of a concurrent object guarantees that every operation completes in a finite number of steps, regardless of how processes interleave. It is known, however, that if concurrent processes communicate onl
- Cited by 3 (0 self) – Add To MetaCart
-
Dynamic quorum adjustment for partitioned data
- A partition occurs when functioning sites in a distributed system are unable to communicate. This paper introduces a new method for managing replicated data objects in the presence of partitions. Each operation provided by a replicated object has a set. of quorums, which are sets of sites whose coop
- Cited by 55 (3 self) – Add To MetaCart
-
Concurrency and availability as dual properties of replicated atomic data network computing architecture
- Abstract. A replicated data object is a typed object that is stored redundantly at multiple locations in a distributed system. Each of the object’s operations has a set of quorums, which are sets of sites whose cooperation is needed to execute that operation. A quorum assignment associates each oper
- Cited by 3 (0 self) – Add To MetaCart
-
A Tutorial on Algebraic Topology and Distributed Computation
- This document is a set of course notes from an informal tutorial to be presented at UCLA in August 1994. These notes are intended to be informative, even provocative, but are not intended to be balanced, comprehensive, or authoritative. All reasonable suggestions for improvement will be enthusiastic
- Cited by 16 (2 self) – Add To MetaCart
-
Wait-Free Synchronization
- A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one data object from another lie
- Cited by 533 (21 self) – Add To MetaCart
-
A Methodology for Implementing Highly Concurrent Data Objects
- A concurrent object is a data structure shared by concurrent processes. Conventional techniques for implementing concurrent objects typically rely on critical sections: ensuring that only one process at a time can operate on the object. Nevertheless, critical sections are poorly suited for asynchron
- Cited by 257 (9 self) – Add To MetaCart
-
Obstruction-free synchronization: Double-ended queues as an example
- We introduce obstruction-freedom, a new nonblocking property for shared data structure implementations. This property is strong enough to avoid the problems associated with locks, but it is weaker than previous nonblocking properties—specifically lock-freedom and wait-freedom— allowing greater flexi
- Cited by 104 (11 self) – Add To MetaCart
-
Apologizing Versus Asking Permission: Optimistic Concurrency Control for Abstract Data Types
- An optimistic concurrency control technique is one that allows transactions to execute without synchronization, relying on commit-time validation to ensure serializability. Several new optimistic concurrency control techniques for objects in decentralized distributed systems are described here, thei
- Cited by 69 (0 self) – Add To MetaCart

