Show simple item record

dc.contributor.authorFriedman, Royen_US
dc.contributor.authorVaysburd, Alexeyen_US
dc.date.accessioned2007-04-23T18:06:36Z
dc.date.available2007-04-23T18:06:36Z
dc.date.issued1996-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR96-1581en_US
dc.identifier.urihttps://hdl.handle.net/1813/7237
dc.description.abstractThis paper presents an implementation of a replicated state machine in asynchronous distributed environments prone to node failures and network partitions. This implementation has two appealing properties: It allows minority partitions to continue providing service for idempotent requests, and it guarantees that progress will be made whenever a majority of replicas can communicate with each other.en_US
dc.format.extent232950 bytes
dc.format.extent174920 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleImplementing Replicated State Machines Over Partitionable Networksen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics