BROADCAST will develop the principles for understanding, designing, and implementing large scale distributed computing systems (LSDCS), in three broad areas: ffl Fundamental concepts. Evaluate and design computational paradigms (such as ordering, causality, consensus); structuring models (groups and fragmented objects); and algorithms (especially for consistency). ffl Systems Architecture. Develop the architecture of LSDCS, in the areas of: naming, identification, binding and locating objects in LSDCS; resource management (e.g. garbage collection); communication and group management. Solutions should scale and take into account fragmentation, and recent technological developments (disconnectable devices and 64-bit address spaces). ffl Systems Engineering. Efficiently supporting the architecture, exploiting the concepts and algorithms developed earlier, as kernel and storage support for numerous fine-grain complex objects; and programming support tools for
|
1760
|
Time, Clocks and the Ordering of Events in a Distributed System
– Lamport
- 1978
|
|
1331
|
Concurrency control and recovery in database systems
– Bernstein, Hadzilacos, et al.
- 1987
|
|
1082
|
Impossibility of distributed consensus with one faulty process
– Fischer, Lynch, et al.
- 1985
|
|
818
|
The byzantine generals problem
– Lamport, Shostak, et al.
- 1982
|
|
805
|
Distributed snapshots: Determining global states of distributed systems
– Chandy, Lamport
- 1985
|
|
687
|
Unreliable failure detectors for reliable distributed systems
– Chandra, Toueg
- 1996
|
|
601
|
the ordering of events in a dis-tributed system
– LAMPORT, clocks
- 1978
|
|
544
|
Light weight causal and atomic group multicast
– Birman, Schiper, et al.
- 1991
|
|
479
|
The process group approach to reliable distributed computing
– Birman
- 1993
|
|
465
|
Weighted voting for replicated data
– Gifford
- 1979
|
|
314
|
The weakest failure detector for solving consensus
– Chandra, Hadzilacos, et al.
- 1996
|
|
278
|
Exploiting virtual synchrony in distributed systems
– Birman, Joseph
- 1987
|
|
222
|
Preserving and using context information in interprocess communication
– Peterson, Buchholz, et al.
- 1989
|
|
168
|
Using process group to implement failure detection in asynchronous environments
– Riccardi, Birman
- 1991
|
|
112
|
Unreliable failure detector for asynchronous systems
– Chandra, Toueg
- 1991
|
|
97
|
The causal ordering abstraction and a simple way to implement it
– Raynal, Schiper, et al.
- 1991
|
|
79
|
A new algorithm to implement causal ordering
– Schiper, Eggli, et al.
- 1989
|
|
78
|
Membership algorithms for multicast communication groups
– Amir, Dolev, et al.
- 1992
|
|
76
|
A membership protocol based on partial order
– Mishra, Peterson, et al.
- 1991
|
|
73
|
Consistency and Recovery Control for Replicated Files
– Davcev, Burkhard
- 1985
|
|
68
|
Uniform reliable multicast in a virtually synchronous environment
– Schiper, Sandoz
- 1993
|
|
59
|
Virtually-synchronous communication based on a weak failure suspector
– Schiper, Ricciardi
- 1993
|
|
42
|
Detection of global state predicates
– Marzullo, Neiger
- 1991
|
|
36
|
A formal model of crash recovery in a distributed system
– Skeen, Stonebraker
- 1983
|
|
31
|
Membership Algorithms for Asynchronous Distributed Systems
– Melliar-Smith, Moser, et al.
- 1991
|
|
23
|
Exploiting Virtual Synchrony
– BIRMAN, JOSEPH
- 1987
|
|
22
|
Time and message efficient reliable broadcasts
– Chandra, Toueg
- 1990
|
|
21
|
An Efficient, Fault-Tolerant Algorithm for Replicated Data
– Abbadi, Skeen, et al.
- 1985
|
|
18
|
Membership Algorithms in Broadcast Domains
– Amir, Dolev, et al.
- 1992
|
|
17
|
Reliable broadcast in synchronous and asynchronous environments
– GOPAL, TOUEG
- 1989
|
|
17
|
Using Knowledge to Optimally Achieve Coordination in Distributed Systems
– Neiger, Bazzi
- 1992
|
|
14
|
Lightweight causal and atomic multicast
– Birman, Schiper, et al.
- 1991
|
|
14
|
Reliable Broadcast Protocols
– Joseph, Birman
- 1989
|
|
6
|
Isis - a distributed programming environment
– Birman, Cooper, et al.
- 1990
|
|
5
|
message ordering and membership using a logical token-passing ring
– Fast
- 1993
|
|
5
|
weak and hybrid group membership
– Strong
- 1992
|
|
5
|
Techniques for Simplifying the Design of Distributed Systems
– Neiger
- 1988
|
|
4
|
The Asynchronous Membership Problem
– Ricciardi
- 1993
|
|
3
|
The Cost of Order in Asynchronous Systems
– Ricciardi, Birman, et al.
- 1992
|
|
3
|
The Atomic Multicast Protocol (AMp), in D.Powell (Ed), Delta-4: A Generic Architecture for Dependable Distributed Computing, Esprit Project 818/2252
– Verissimo, Rufino
- 1991
|
|
3
|
The possibility and the complexity of achieving faulttolerant coordination
– Bazzi, Neiger
- 1992
|
|
3
|
A Bibliography on Multicast and
– Chanson, Neufeld, et al.
- 1989
|
|
2
|
Reaching agreement on processor-group membership in synchronous distributed systems
– Christian
- 1991
|
|
2
|
S.T.Chanson and G.W.Neufeld, Process Groups and Group Communications: Classifications and Requirements
– Liang
- 1990
|
|
1
|
Toueg.Unreliable Failure Detectors for Asynchronous Systems
– S
- 1991
|
|
1
|
Termination detection in an asynchronoussystem subject to failures
– Schiper
- 1992
|
|
