N. Budhiraja, K. Marzullo, F. Schneider, and S. Toueg. Primary-backup protocols: Lower bounds and optimal implementations. In Proceedings of the 3rd IFIP Working Conference on Dependable Computing for Critical Applications, pages 187--198. Springer-Verlag, Wien, 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Configurable Fault-Tolerant Distributed Services - Hiltunen (1996) (2 citations) (Correct)
....client requests being sent to all replicas for execution using atomic ordered multicast. This approach is an example of active replication, where every replica executes the same operations. In the primary backup paradigm, only one of the replicas actively executes client requests [AD76, BJRA85, BMST92] with the state of the other backup replicas being updated periodically. This approach is an example of passive replication. In the object action paradigm, the system is constructed of passive objects that export actions, i.e. operations, that modify the state of objects [Gra86] Applications ....
N. Budhiraja, K. Marzullo, F. Schneider, and S. Toueg. Primary-backup protocols: Lower bounds and optimal implementations. In Proceedings of the 3rd IFIP Working Conference on Dependable Computing for Critical Applications, pages 187--198. Springer-Verlag, Wien, 1992.
Implementing Adaptive Fault-Tolerant Services for Hybrid Faults - Gong, Goldberg (Correct)
....backup, state machine, manifest faults, Byzantine faults, hybrid faults, adaptivity, distributed systems services, algorithm complexity. 1 Introduction In building fault tolerance services in a distributed system, there are two major approaches, namely, the Primary Backup approach (PB) e.g. [1, 9]) and the State Machine approach (SM) e.g. 19, 16] Each approach has its distinctive advantages. To tolerate simple faults such as crash and omission, PB protocols are generally significantly cheaper than SM protocols in terms of the numbers of processors, messages, and rounds (which directly ....
....the protocol after Round 3, earlier than the servers. 4 Related Work Our work is undertaken within the general framework outlined in [12] and can be viewed as a realization of some of the principles of adaptive fault tolerance. We have made heavy use of materials on primary backup protocols [9, 8, 6] and the state machine approach [16] In particular, our adaptive algorithms use those protocols as building blocks, in a modular fashion. Previous work on handling hybrid faults appears to focus on extending protocols for Byzantine agreement so that they can tolerate a higher number of benign or ....
[Article contains additional citation context not shown here]
N. Budhiraja, K. Marzullo, F.B. Schneider, and S. Toueg. Primary-Backup Protocols: Lower Bounds and Optimal Implementations. In Proc. 3rd IFIP Working Conference on Dependable Computing for Critical Applications, pages 187--196, Sicily, Italy, September 1992.
The Enterprise Executive - Wong (1992) (1 citation) (Correct)
....undertake the same task, with the caller waiting for the first response and continuing to execute without waiting for a response from the others. It achieves fault tolerance at the cost of wasted CPU cycles. Another approach in ISIS is the coordinator cohort computation (the standby approach) (Budiraja et al. 1992). The method works by ranking the members of a process group and then labeling the lowest ranking member as the coordinator for a request. This process will execute the request and broadcast a reply to the caller. The other members are cohorts; they are passive unless a failure prevents the ....
N. Budiraja, K. Marzullo, F.B. Schneider and S. Toueg. Primary-Backup Protocols: Lower Bounds and Optimal Implementations, 1992, Technical Report TR-92-1265, Computer Science Department, Cornell University.
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