Download:
|
by Dahlia Malkhi, Michael K. Reiter
In Proceedings of the 17th IEEE Symposium on Reliable Distributed Systems
http://www.research.att.com/~dalia/././pubs/srds-system.ps.gz
Add To MetaCart
Abstract:
Phalanx is a software system for building a persistent, survivable data repository that supports shared data abstractions (e.g., variables, mutual exclusion) for clients. Phalanx implements data abstractions that ensure useful properties without trusting the servers supporting these abstractions or the clients accessing them, i.e., Phalanx can survive even the arbitrarily malicious corruption of clients and (some number of) servers. At the core of the system are survivable replication techniques that enable efficient scaling to hundreds of Phalanx servers. In this paper we describe the implementation of some of the data abstractions provided by Phalanx, discuss their ability to scale to large systems, and describe an example application.
Citations
|
1752
|
New directions in cryptography
– Diffie, Hellman
- 1976
|
|
1073
|
Impossibility of distributed consensus with one faulty process
– Fischer, Lynch, et al.
- 1985
|
|
847
|
Memory coherence in shared virtual memory systems
– Li, Hudak
- 1989
|
|
801
|
How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs
– Lamport
- 1979
|
|
572
|
Implementing fault-tolerant services using the state machine approach: A tutorial
– Schneider
- 1990
|
|
532
|
Linearizability: a correctness condition for concurrent objects
– Herlihy, Wing
- 1990
|
|
344
|
Authentication in Distributed Systems: Theory and Practice
– Lampson, Abadi, et al.
- 1991
|
|
253
|
Munin: Distributed Shared Memory Based on Type-Specific Memory Coherence
– Bennett, Carter, et al.
- 1990
|
|
213
|
Solution of a Problem in Concurrent Programming Control
– Dijkstra
- 1974
|
|
209
|
Atomic Broadcast: From Simple Message Diffusion To Byzantine Agreement
– Cristian, Aghili, et al.
- 1985
|
|
161
|
A new solution of Dijkstra’s concurrent programming problem
– Lamport
- 1974
|
|
154
|
Secure agreement protocols: Reliable and atomic group multicast in rampart
– Reiter
- 1994
|
|
144
|
The Eternity Service
– Anderson
- 1996
|
|
120
|
The SecureRing protocols for securing group communication
– Kihlstrom, Moser, et al.
- 1998
|
|
98
|
Fast randomized consensus using shared memory
– Aspnes, Herlihy
- 1990
|
|
82
|
The Digital distributed system security architecture
– GASSER, GOLDSTEIN, et al.
- 1989
|
|
75
|
Implementation of Argus
– Liskov, Curtis, et al.
- 1987
|
|
54
|
On Interprocess Communication, Part II: Algorithms
– Lamport
- 1986
|
|
54
|
Safe and efficient sharing of persistent objects in Thor
– Liskov, Adya, et al.
- 1996
|
|
48
|
Group communication
– Powell
- 1996
|
|
44
|
The load and availability of Byzantine quorum systems
– Malkhi, Reiter, et al.
- 2000
|
|
33
|
The Ω key management service
– Reiter
- 1996
|
|
18
|
Principal features of the voltan family of reliable node architectures for distributed systems
– Shrivastava, Ezhilchelvan, et al.
- 1992
|
|
9
|
SESAME V2 public key and authorization extensions to Kerberos
– McMahon
- 1995
|
|
6
|
Byzantine quorum systems. Distributed Computing 11(4), to appear. Preliminary version appears
– Malkhi, Reiter
- 1997
|
|
5
|
Survivable consensus objects
– Malkhi, Reiter
- 1998
|
|
3
|
A correctness condition for memory shared among Byzantine clients
– Malkhi, Reiter, et al.
|
|
3
|
Probabilistic quorum systems. Submitted for publication. Preliminary version appears
– Malkhi, Reiter, et al.
- 1997
|
