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 5 of 5 for “"Replicated state machines"”.

  1. CheckSync: Transparent Primary-Backup Replication for Go Applications Using Checkpoints

    … common way to achieve this is through the use of replicated state machines, an approach in which the application is replicated across multiple machines. There could be as few as two in a primary/backup arrangement, or more to reduce the risk of downtime. Each instance starts in the same state, and …

    mit Repository record for CheckSync: Transparent Primary-Backup Replication for Go Applications Using Checkpoints (opens in a new tab)

  2. Virtual infrastructure for wireless ad hoc networks

    … and present new algorithms based on the replicated-state-machine paradigm to implement these infrastructural components. In the second part of this thesis, I focus on the problem of developing virtual infrastructure for more realistic networks, in particular coping with the problem of …

    mit Repository record for Virtual infrastructure for wireless ad hoc networks (opens in a new tab)

  3. Empirical study of unstable leaders in Paxos

    … consensus, and is often used for building replicated state machines. Safety is guaranteed by Paxos algorithm regardless of various machine and communication failures. However, the liveness is compromised when multiple Paxos leaders exist at the same time. Also, despite the extensive …

    uiuc Repository record for Empirical study of unstable leaders in Paxos (opens in a new tab)

  4. Eventual fault recovery strategies for Byzantine failures

    … for recovering from Byzantine failures in replicated state machines. In contrast to traditional Byzantine fault tolerance (BFT), which attempts to mask faults, this protocol is designed to allow faults to be exposed to clients but ensures that no client can fork the state of the system by …

    uiuc Repository record for Eventual fault recovery strategies for Byzantine failures (opens in a new tab)

  5. A fail-slow tolerant Raft implementation

    Fail-slow tolerance has been a long-desired trait for computer systems. A fail-slow fault causes a hardware or software component to experience performance degradation without stopping or terminating. We inject fail-slow faults into existing distributed database systems. We observe that they cannot …

    uiuc Repository record for A fail-slow tolerant Raft implementation (opens in a new tab)