Performance Optimization for State Machine Replication Based on Application Semantics: A Review

Document Type

Article

Publication Date

2-1-2016

Publication Title

Journal of Systems and Software

Abstract

The pervasiveness of cloud-based services has significantly increased the demand for highly dependable systems. State machine replication is a powerful way of constructing highly dependable systems. However, state machine replication requires replicas to run deterministically and to process requests sequentially according to a total order. In this article, we review various techniques that have been used to engineer fault tolerance systems for better performance. Common to most such techniques is the customization of fault tolerance mechanisms based on the application semantics. By incorporating application semantics into fault tolerance design, we could enable concurrent processing of requests, reduce the frequency of distributed agreement operations, and control application nondeterminism. We start this review by making a case for considering application semantics for state machine replication. We then present a classification of various approaches to enhancing the performance of fault tolerance systems. This is followed by the description of various fault tolerance mechanisms. We conclude this article by outlining potential future research in high performance fault tolerance computing.

Comments

This work was supported in part by NSF grant CNS-0821319 and by a graduate faculty travel award from Cleveland State University.

DOI

10.1016/j.jss.2015.11.006

Volume

112

Link to Full Text

Share

COinS