Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 12 of 12 for “"State Machine Replication"”.
-
Scalable Byzantine State Machine Replication: Designs, Techniques, and Implementations
State machine replication (SMR) is one of the most widely studied and used methodology for building highly available distributed applications and services. SMR replicates a service across a set of computing hosts, and executes client operations on the replicas in an agreed- upon total order, …
-
Improving Performance of Byzantine State Machine Replication through Self-Adaptation
Byzantine Fault-Tolerant (BFT) State Machine Replication (SMR) provides strong resilience against faults and intrusions, making it a solid foundation for building dependable distributed systems. However, its practical adoption remains limited due to several challenges: high operational costs …
-
Towards Fast and Adaptive Byzantine State Machine Replication for Planetary-Scale Systems
State machine replication (SMR) is a classical approach for building resilient distributed systems. In Byzantine fault-tolerant (BFT) systems, no concrete assumptions are made about the behavior of faulty replicas. With the advancement of distributed ledger technologies (DLT), planetary-scale BFT …
-
HQ replication
… approaches to providing Byzantine-fault-tolerant state machine replication: an agreement-based approach, e.g., BFT, that uses communication between replicas to agree on a proposed ordering of requests, and a quorum-based approach, such as Q/U, in which clients contact replicas directly to …
-
Parsimonious Service Replication for Tolerating Malicious Attacks in Asynchronous Environments
… kind of faults, namely Byzantine faults, through state machine replication in asynchronous environments such as the Internet. In Byzantine-fault-tolerant (BFT) state machine replication, state consistency among the replicas of a service is maintained by first agreeing on the order of requests to …
-
Keeping checkpoint/restart viable for exascale systems
… systems. More specifically, this work evaluates state-machine replication to dramatically increase the checkpoint interval (the time between successive checkpoints) and hash-based, probabilistic incremental checkpointing using graphics processing units to decrease the checkpoint commit time (the …
-
Replication of Concurrent Applications in a Shared Memory Multikernel
State Machine Replication (SMR) has become the de-facto methodology of building a replication based fault-tolerance system. Current SMR systems usually have multiple machines involved, each of the machines in the SMR system acts as the replica of others. However having multiple machines leads to …
-
A Scalable Leader Based Consensus Algorithm
… of computing, redundancy is attained through state machine repli- cation. Protocols like Raft, Multi-Paxos, ZAB, or other variants of Paxos are commonly used to achieve state machine replication. These protocols choose one of the processes from multiple processes running on various machines in …
-
A Low-latency Consensus Algorithm for Geographically Distributed Systems
… and high throughput compared to the existing state-of-the- art, and tolerate replica failures. Recently, a number of state-of-the-art consensus protocols that implement the Generalized Consensus definition have been proposed. However, the major limitation of these existing approaches is the …
-
Generalized Consensus for Practical Fault-Tolerance
… speedup over XPaxos and up to 3.5x speedup over state-of-the-art Byzantine Fault-Tolerant Consensus Protocols.
-
Optimizing Distributed Transactions: Speculative Client Execution, Certified Serializability, and High Performance Run-Time
… (DBMS) in many cases. Many on-line services use replication to ensure high-availability, fault tolerance and scalability. Replicated systems typically consist of different nodes running the service co-ordinated by a distributed algorithm which aims to drive all the nodes along the same sequence …
-
On Improving Distributed Transactional Memory through Nesting, Partitioning and Ordering
… sub- transactions can commit to the shared state independently of their parents. This reduces isolation and increases concurrency. Our first main contribution in this dissertation are two extensions to the existing Transac- tional Forwarding Algorithm (TFA). Our extensions are N-TFA and …