Advanced search

Found 5 essays matching the above criteria.

1. 1. Distributed Consensus: Performance Comparison of Paxos and Raft

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : Harald Ng; [2020]
   Keywords : Paxos; Multi-Paxos; Leader-based Sequence Paxos; Raft; Distributed Systems; Consensus; Replicated State Machine; Paxos; Multi-Paxos; Leader-based Sequence Paxos; Raft; Distribuearade System; Konsensus; Replikerad Tillståndsmaskin;

   Abstract : With the growth of the internet, distributed systems have become increasingly important in order to provide more available and scalable applications. Con- sensus is a fundamental problem in distributed systems where multiple pro- cesses have to agree on the same proposed value in the presence of partial failures. READ MORE

3. 2. Flexible Paxos : An Industry Perspective

   University essay from Blekinge Tekniska Högskola/Institutionen för programvaruteknik

   Author : MAX MELDRUM; [2017]
   Keywords : ;

   Abstract : Paxos is an algorithm for implementing fault-tolerant distributed systems. The core of Paxos is found in many consensus algorithms. Raft and Zab are two prominent protocols that are used in the industry. They serve as the foundation of distributed key-value stores and coordination services such as Consul, Etcd and ZooKeeper. READ MORE

4. 3. Multi Data center Transaction Chain : Achieving ACID for cross data center multi-key transactions

   University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

   Author : Qinjin Wang; [2016]
   Keywords : ;

   Abstract : Transaction support for Geo-replicated storage system is one of the most popular challenges in the last few years. Some systems gave up for supporting transactions and let upper application layer to handle it. READ MORE

5. 4. A Distributed Lock Manager Using Paxos : Design and Implementation of Warlock, a Consensus Based Lock Manager

   University essay from Institutionen för informationsteknologi

   Author : Sukumar Yethadka; [2013]
   Keywords : ;

   Abstract : Locking primitives are one of the mechanisms used by distributed systems to synchronize access to shared data or to serialize their actions. Depending on the design, the locking service may constitute a single point of failure. This requires the manager itself to be distributed. READ MORE

6. 5. Persistence and Node FailureRecovery in Strongly Consistent Key-Value Datastore

   University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

   Author : Muhammad Ehsan ul Haque; [2012]
   Keywords : Datastore; Distributed Hash Table DHT ; Atomic Shared Registers; Disk Storage; Consistency; Failure Recovery; Paxos; Group Membership;

   Abstract : Consistency preservation of replicated data is a critical aspect for distributed databaseswhich are strongly consistent. Further, in fail-recovery model each process also needs todeal with the management of stable storage and amnesia [1]. READ MORE