An inheritance-based technique for building simulation proofs incrementally
Proceedings of the 22nd international conference on Software engineering
Specifying and using a partitionable group communication service
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Information and System Security (TISSEC)
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Moshe: A group membership service for WANs
ACM Transactions on Computer Systems (TOCS)
Application-based dynamic primary views in asynchronous distributed systems
Journal of Parallel and Distributed Computing
Implementing a replicated service with group communication
Journal of Systems Architecture: the EUROMICRO Journal
Fully Distributed Three-Tier Active Software Replication
IEEE Transactions on Parallel and Distributed Systems
The SMART way to migrate replicated stateful services
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Using selective acknowledgements to reduce the memory footprint of replicated services
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Hi-index | 0.00 |
The paper presents an implementation of replicated state machines in asynchronous distributed environments prone to node failures and network partitions. This implementation has several appealing properties: it guarantees that progress will be made whenever a majority of replicas can communicate with each other; it allows minority partitions to continue providing service for idempotent requests; it offers the application the choice between optimistic or safe message delivery. Performance measurements have shown that our implementation incurs low latency and achieves high throughput while providing globally consistent replicated state machine semantics.