We present an improvement to the Disk Paxos protocol by Gafni and Lamport which utilizes extended functionality and flexibility provided by Active Disks and supports unmediated concurrent data access by an unlimited number of processes. The solution facilitates coordination by an infinite number of clients using finite shared memory. It is based on a collection of read-modify-write objects with faults, that emulate a new, reliable shared memory abstraction called a ranked register. The required read-modify-write objects are readily available in Active Disks and in Object Storage Device controllers, making our solution suitable for state-of-the-art Storage Area Network (SAN) environments. 1.
|
1747
|
Time, clocks and the ordering of events in a distributed system
– Lamport
- 1978
|
|
1074
|
Impossibility of distributed consensus with one faulty process
– Fischer, Lynch, et al.
- 1985
|
|
806
|
The Byzantine generals problem
– Lamport, Shostak, et al.
- 1982
|
|
683
|
Unreliable Failure Detectors for Reliable Distributed Systems
– Chandra, Toueg
- 1996
|
|
573
|
Implementing fault-tolerant services using the state machine approach: A tutorial
– Schneider
- 1990
|
|
498
|
Wait-Free Synchronization
– Herlihy
- 1991
|
|
366
|
Serverless network file systems
– Anderson, Dahlin, et al.
- 1996
|
|
310
|
The Weakest Failure Detector for Solving Consensus
– Chandra, Hadzilacos, et al.
- 1996
|
|
310
|
Consensus in the presence of partial synchrony
– Dwork, Lynch, et al.
- 1988
|
|
280
|
The Part-Time Parliament
– Lamport
- 1998
|
|
279
|
Exploiting virtual synchrony in distributed systems
– Birman, Joseph
- 1987
|
|
233
|
Petal: Distributed virtual disks
– Lee, Thekkath
- 1996
|
|
222
|
Group communication specifications: A comprehensive study
– Chockler, Keidar, et al.
- 2001
|
|
217
|
Frangipani: A Scalable Distributed File System
– Lee, Thekkath
- 1997
|
|
206
|
On the minimal synchronism needed for distributed consensus
– Dolev, Dwork, et al.
- 1987
|
|
178
|
A Quorum-Based Commit Protocol
– Skeen
- 1982
|
|
152
|
The timed asynchronous distributed system model
– Cristian, Fetzer
- 1999
|
|
142
|
Active disks: Programming model, algorithms and evaluation
– Acharya, Uysal, et al.
- 1998
|
|
131
|
A Cost-Effective, High-Bandwidth Storage Architecture
– Gibson, Nagle, et al.
- 1998
|
|
127
|
Memory Requirements for Agreement Among Unreliable Asynchronous Processes
– Loui, Abu-Amara
- 1987
|
|
94
|
Specifying and using a partitionable group communication service
– FEKETE, LYNCH, et al.
- 1997
|
|
62
|
A case for network-attached secure disks
– Gibson, Nagle, et al.
- 1996
|
|
51
|
How to Build a Highly Available System Using Consensus
– Lampson
- 1996
|
|
50
|
Fault-tolerant wait-free shared objects
– Jayanti, Chandra, et al.
- 1998
|
|
49
|
Randomization in byzantine agreement
– Chor, Dwork
- 1989
|
|
48
|
Group communication
– Powell
- 1996
|
|
42
|
Bounds on shared memory for mutual exclusion
– Burns, Lynch
- 1993
|
|
36
|
Crash recovery in distributed database systems
– SKEEN
- 1980
|
|
35
|
Disk paxos
– Gafni, Lamport
- 2000
|
|
32
|
Highly concurrent shared storage
– Amiri, Gibson, et al.
- 2000
|
|
24
|
Backoff protocols for distributed mutual exclusion and ordering
– Chockler, Malkhi, et al.
- 2001
|
|
24
|
Security for Network Attached Storage Devices
– Gobioff, Gibson, et al.
- 1997
|
|
23
|
The Swarm Scalable Storage System
– Hartman, Murdock, et al.
- 1999
|
|
23
|
Active disks for large-scale data processing
– Riedel, Faloutsos, et al.
- 2001
|
|
21
|
Deconstructing Paxos
– Boichat, Dutta, et al.
- 2001
|
|
20
|
Computing with faulty shared objects
– Afek, Greenberg, et al.
- 1995
|
|
18
|
Data management in a distributed file system for Storage Area Networks
– Burns
- 2000
|
|
15
|
The concurrency hierarchy, and algorithms for unbounded concurrency
– Gafni, Merritt, et al.
- 2001
|
|
15
|
Totally ordered broadcast in the face of network partitions. exploiting group communication for replication in partitionable networks
– KEIDAR, DOLEV
- 2000
|
|
14
|
Computing with infinitely many processes
– Merritt, Taubenfeld
- 2000
|
|
10
|
An architecture for survivable coordination in large-scale systems
– Malkhi, Reiter
- 2000
|
|
6
|
Fundamental study revisiting the paxos algorithm
– PRISCO, LAMPSON, et al.
- 2000
|
|
5
|
Internet protocols for network-attached peripherals
– Hotz, Meter, et al.
- 1998
|
|
5
|
Leader-based consensus. Parallel Process
– Mostéfaoui, Raynal
- 2001
|
|
4
|
Paxos made simple. Distributed Computing
– Lamport
- 2001
|
