Logo des Repositoriums
 

Efficient Checkpointing in Byzantine Fault-Tolerant Systems

dc.contributor.authorEischer, Michael
dc.contributor.authorDistler, Tobias
dc.date.accessioned2019-12-03T09:11:08Z
dc.date.available2019-12-03T09:11:08Z
dc.date.issued2019
dc.description.abstractDistributed Byzantine fault-tolerant systems require frequent checkpoints of the application state to perform periodic garbage collection and enable faulty replicas to recover efficiently. State-of-the-art checkpointing approaches for replicated systems either cause significant service disruption when the application state is large, or they are unable to produce checkpoints that are verifiable across replicas. To address these problems we developed and evaluated deterministic fuzzy checkpointing, a technique to create consistent and verifiable checkpoints in parallel with request execution.en
dc.identifier.doi10.18420/fbsys2019-01
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/30633
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofTagungsband des FB-SYS Herbsttreffens 2019
dc.subjectCheckpointing
dc.subjectState-Machine Replication
dc.subjectFault Tolerance
dc.titleEfficient Checkpointing in Byzantine Fault-Tolerant Systemsen
dc.typeText
gi.citation.publisherPlaceBonn
gi.conference.date21.-22. November 2019
gi.conference.locationOsnabrück
gi.document.qualitydigidoc

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
Paper01.pdf
Größe:
470.37 KB
Format:
Adobe Portable Document Format