(Enter summary)
Abstract: This report presents a replica control protocol for atomic objects. The protocol is derived from an
atomic broadcast primitive, and places constraints on the delivery of messages to provide a consistent
message order among sites. Several heuristic techniques are proposed to reduce the latency of message
delivery, for two types of orders. Messages are delivered either in the same order for all sites, or in an order
semantically equivalent to this unique ordering. The equivalence relation is... (Update)
Context of citations to this paper: More
...of fault tolerant distributed applications. Although several protocols have been described in the literature [5, 3, 19, 17, 13, 12, 4, 16, 7, 1, 11], few were specifically targeted to operate in large scale systems. Among the several algorithms to implement total...
...implementing fault tolerant distributed applications. Although several protocols have been described in the literature [2, 3, 4, 5, 7, 11, 12, 13, 15, 16, 18], few were specifically targeted to operate in (geographically) large scale systems. In a large scale network processes...
Cited by: More
Service and Protocol Architecture for the MAFTIA Middleware - Veríssimo, Neves (2001)
(Correct)
A Dynamic Hybrid Protocol for Total Order in.. - Rodrigues, Fonseca.. (1994)
(Correct)
Totally Ordered Multicast in Large-Scale Systems - Rodrigues, Fonseca.. (1996)
(Correct)
Active bibliography (related documents): More All
6.2: Highly Available Replicated Atomic Data - Maugis (1994)
(Correct)
0.5: New Rules for Early Delivery in an Atomic Multicast System - Johnson, Maugis (1994)
(Correct)
0.5: Optimizing the Performance of Quorum Consensus Replica Control.. - Cheung (1990)
(Correct)
Similar documents based on text: More All
0.1: Design and Implementation of Active Capability for an.. - Chakravarthy Anwar (1993)
(Correct)
0.1: Deterministic Chaos in Failure Dynamics: Dynamics of Peeling of.. - Hong, Yue (1995)
(Correct)
0.1: Epilepsy - When Chaos Fails - Sackellares, al.
(Correct)
Related documents from co-citation: More All
4: Lightweight causal and atomic group multicast (context) - Birman, Schiper et al. - 1991
3: Fast message ordering and membership using a logical token-passing ring
- Amir, Moser et al. - 1993
3: Group Communication in the Amoeba Distributed Operating System (context) - Kaashoek, Tanenbaum - 1991
BibTeX entry: (Update)
T. Johnson and L. Maugis. Two approaches for high concurrency in multicast-based object replication. Technical Report 94-041, Department of Computer and Information Sciences, University of Florida, 1994. http://citeseer.ist.psu.edu/johnson94two.html More
@article{ johnson94two,
author = "Mark Johnson",
title = "Two Ways of Formalizing Grammars",
journal = "Linguistics and Philosophy",
volume = "17",
number = "3",
pages = "221--248",
year = "1994",
url = "citeseer.ist.psu.edu/johnson94two.html" }
Citations (may not include all citations):
1209
Concurrency Control and Recovery in Database Systems (context) - Bernstein, Hadzilacos et al. - 1987
739
Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
716
Parallel Program Design: A Foundation (context) - Chandy, Misra - 1988
572
Distributed snapshots: determining global states of distribu.. (context) - Chandy, Lamport - 1985
532
Host extensions for IP multicasting (context) - Deering - 1989
470
Lightweight causal and atomic group multicast (context) - Birman, Schiper et al. - 1991
414
Unreliable failure detectors for reliable distributed system..
- Chandra, Toueg - 1991
373
clocks and the ordering of events in a distributed system (context) - Lamport - 1978
350
Implementing fault-tolerant services using the state machine..
- Schneider - 1990
349
The process group approach to reliable distributed computing (context) - Birman - 1991
326
Linearizability: a correctness condition for concurrent obje.. (context) - Herlihy, Wing - 1990
310
Transis: A communication sub-system for high availability
- Amir, Dolev et al. - 1992
291
Weighted voting for replicated data
- Gifford - 1979
262
Epidemic algorithms for replicated database maintenance (context) - Demers, Greene et al. - 1987
214
Preserving and using context information in interprocess com..
- Peterson, Buchholz et al. - 1989
189
A majority consensus approach to concurrency control for mul.. (context) - Thomas - 1979
185
Distributed Systems (context) - Mullender - 1993
144
Atomic broadcast: From simple message diffusion to byzantine..
- Cristian, Aghili et al. - 1984
141
Consistency in partitioned networks (context) - Davidson, Garcia-Molina et al. - 1985
132
Reaching agreement on processor-group membership in synchron..
- Cristian - 1991
131
Distributed process groups in the V kernel (context) - Cheriton, Zwaenepoel - 1985
125
ACM Transactions on Computer Systems (context) - Chang, Maxemchuk et al. - 1984
118
Consul: A communication substrate for fault-tolerant distrib..
- Mishra, Peterson et al. - 1991
116
Concurrency control in distributed database systems (context) - Bernstein, Goodman - 1981
115
Commutativity-based concurrency control for abstract data ty.. (context) - Weihl - 1988
111
How to assign votes in a distributed system (context) - Garcia-Molina, Barbara - 1985
103
On Numbers and Games (context) - Conway - 1976
102
Dynamic voting algorithms for maintaining the consistency of.. (context) - Jajodia, Mutchler - 1990
101
Atomic Transactions (context) - Lynch, Merritt et al. - 1994
97
Fast message ordering and membership using a logical token p..
- Amir, Moser et al. - 1993
92
The grid protocol: A high performance scheme for maintaining..
- Cheung, Ammar et al. - 1992
90
Replication in the Harp file system
- Liskov, Ghemawat et al. - 1991
89
Providing high availability using lazy replication
- Ladin, Liskov et al. - 1992
79
A quorum-consensus replication method for abstract data type.. (context) - Herlihy - 1986
72
Hierarchical quorum consensus: A new algorithm for managing .. (context) - Kumar - 1991
72
A membership protocol based on a partial order (context) - Mishra, Peterson et al. - 1991
71
Membership algorithms for multicast communication groups
- Amir, Dolev et al. - 1992
64
An algorithm for concurrency control and recovery in replica.. (context) - Bernstein, Goodman - 1984
62
Fault-tolerance in the advanced automation system (context) - Cristian - 1991
56
An asynchronous membership protocol that tolerates partition..
- Dolev, Malki et al. - 1993
54
A fault-tolerant protocol for atomic broadcast (context) - Luan, Gligor - 1990
53
Axioms of Cooperative Decision Making (context) - Moulin - 1988
51
Local atomicity properties: Modular concurrency control for .. (context) - Weihl - 1989
49
Voting with witnesses: A consistency scheme for replicated f.. (context) - Paris - 1986
49
Dynamic quorum adjustment for partitioned data (context) - Herlihy - 1987
48
Elections in a distributed computing system (context) - Garcia-Molina - 1982
44
IEEE transactions on parallel and distributed systems (context) - Melliar-Smith, Moser et al. - 1990
44
Readings in Database Systems (context) - Stonebraker - 1993
43
Synchronous atomic broadcast for redundant broadcast channel..
- Cristian - 1990
39
Performance characterization of quorum-consensus algorithms .. (context) - Ahamad, Ammar - 1989
37
Reliable multicast between micro-kernels
- Van Renesse, Birman et al. - 1992
36
The impact of recovery on concurrency control (context) - Weihl - 1989
34
Membership algorithms for asynchronous distributed systems (context) - Moser, Melliar-Smith et al. - 1991
30
Voting with ghosts
- Van Renesse, Tanenbaum - 1988
30
Regeneration of replicated objects: a technique and its eden.. (context) - Pu, Noe et al. - 1988
28
Implementing fault-tolerant replicated objects using psync (context) - Mishra, Peterson et al. - 1989
27
ACM Transactions on Computer Systems (context) - Barbara, Garcia-Molina et al. - 1986
26
Incremental recovery in main memory database systems
- Levy, Silberschatz - 1992
26
Efficient dynamic voting algorithms (context) - Paris, Long - 1988
25
Early delivery totally ordered broadcast in asynchronous env.. (context) - Dolev, Kramer et al. - 1993
23
Achieving robustness in distributed database systems (context) - Eager, Sevcik - 1983
23
Consistency and orderability: Semantics-based correctness cr..
- Agrawal, Abbadi et al. - 1993
21
The reliability of voting mechanisms (context) - Barbara, Garcia-Molina - 1987
21
Voting as the optimal static pessimistic scheme for managing.. (context) - Spasojevic, Berman - 1994
20
Cheating husbands and other stories: A case study of knowled.. (context) - Moses, Dolev et al. - 1985
20
Efficiency of synchronous versus asynchronous distributed sy.. (context) - Arjomandi, Fischer et al. - 1983
19
Clock synchronization in the presence of omission and perfor..
- Cristian, Aghili et al. - 1992
18
Cost and availability tradeoffs in replicated data concurren.. (context) - Kumar, Segev - 1993
17
Asynchronous fault-tolerant total ordering algorithms (context) - Moser, Melliar-Smith et al. - 1993
14
OSCAR: A system for weak-consistency replication (context) - Downing, Greenberg et al. - 1990
12
An efficient fault-tolerant algorithm for replicated data ma.. (context) - Abbadi, Skeen et al. - 1985
11
Viewstamped replication: A general primary copy method to su.. (context) - Oki, Liskov - 1988
11
Fault-tolerant distributed systems based on broadcast commun.. (context) - Melliar-Smith, Moser - 1989
11
The generalized tree quorum protocol: An efficient approach .. (context) - Agrawal, Abbadi - 1992
10
Optimizing vote and quorum assignments for reading and writi..
- Cheung, Ahamad et al. - 1989
9
Efficient reliable group communication for distributed syste..
- Kaashoek, Tanenbaum - 1994
6
Performance measurement of main memory database recovery alg.. (context) - Burger, Kumar - 1992
5
Total ordering of messages in broadcast domains
- Dolev, Kramer et al. - 1992
4
Linguistic support for atomic data types (context) - Weihl - 1990
4
A transaction procressing testbed for memory resident data (context) - Salem, Garcia-Molina - 1990
4
Brams and Peter C (context) - Steven - 1983
4
Necessary and sufficient conditions for broadcast consensus .. (context) - Moser, Melliar-Smith et al. - 1993
3
Concurrency and availability as dual properties of replicate.. (context) - Herlihy, Zahn et al. - 1990
3
Topics in the Theory of Voting (context) - Straffin - 1980
3
Protocols for dynamic vote reassignment (context) - Barbara, Garcia-Molina - 1986
2
The group membership problem in asynchronous distributed sys.. (context) - Ricciardi - 1994
2
Analyzing the performance of complex systems (context) - Melliar-Smith, Moser - 1991
2
The Byzantine generals (context) - Dolev, Lamport et al. - 1987
2
Fairness and strategy in voting (context) - Moulin - 1985
1
Extending fTCPg for transactions (context) - Braden - 1992
1
Simpack is available via anonymous ftp at ftp (context) - Fishwick, Design et al. - 1994
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.cis.ufl.edu.html): More
Sherman-Morrison-Woodbury Formula-based Algorithms for the.. - Lai, Vemuri
(Correct)
Interruptible Critical Sections - Johnson, Harathi (1994)
(Correct)
A Highly Concurrent Priority Queue Based on the B-link Tree - Johnson (1991)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC