Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2007-01-21
Computer Science
Distributed, Parallel, and Cluster Computing
To appear in the proceedings of the 3rd IEEE International Symposium on Dependable, Autonomic and Secure Computing, 2007
Scientific paper
All practical applications contain some degree of nondeterminism. When such applications are replicated to achieve Byzantine fault tolerance (BFT), their nondeterministic operations must be controlled to ensure replica consistency. To the best of our knowledge, only the most simplistic types of replica nondeterminism have been dealt with. Furthermore, there lacks a systematic approach to handling common types of nondeterminism. In this paper, we propose a classification of common types of replica nondeterminism with respect to the requirement of achieving Byzantine fault tolerance, and describe the design and implementation of the core mechanisms necessary to handle such nondeterminism within a Byzantine fault tolerance framework.
No associations
LandOfFree
Byzantine Fault Tolerance for Nondeterministic Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Byzantine Fault Tolerance for Nondeterministic Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Byzantine Fault Tolerance for Nondeterministic Applications will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-516093