Filters








309 Hits in 2.4 sec

Disk Paxos

Eli Gafni, Leslie Lamport
2003 Distributed computing  
Like the original Paxos algorithm, Disk Paxos maintains consistency in the presence of arbitrary non-Byzantine faults.  ...  We present an algorithm, called Disk Paxos, for implementing a reliable distributed system with a network of processors and disks.  ...  It includes a sketch of an incomplete correctness proof and explains the relation between Disk Synod and the Synod protocol of classic Paxos.  ... 
doi:10.1007/s00446-002-0070-8 fatcat:fumtprnclnfc5fqpfb3gcdsiiu

Disk Paxos [chapter]

Eli Gafni, Leslie Lamport
2000 Lecture Notes in Computer Science  
Like the original Paxos algorithm, Disk Paxos maintains consistency in the presence of arbitrary non-Byzantine faults.  ...  We present an algorithm, called Disk Paxos, for implementing a reliable distributed system with a network of processors and disks.  ...  It includes a sketch of an incomplete correctness proof and explains the relation between Disk Synod and the Synod protocol of classic Paxos.  ... 
doi:10.1007/3-540-40026-5_22 fatcat:7fgfkftqlvholfjaxyt3ms3cj4

Paxos made live

Tushar D. Chandra, Robert Griesemer, Joshua Redstone
2007 Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing - PODC '07  
We describe our experience in building a fault-tolerant database using the Paxos consensus algorithm. Despite the existing literature in the field, building such a database proved to be non-trivial.  ...  We describe selected algorithmic and engineering problems encountered, and the solutions we found for them. Our measurements indicate that we have built a competitive system.  ...  They introduced us to the mechanism for handling disk corruptions and suggested that we implement master leases.  ... 
doi:10.1145/1281100.1281103 dblp:conf/podc/ChandraGR07 fatcat:frpf2z43zbet3f4k3brrowhvui

Multi-Ring Paxos

Parisa Jalili Marandi, Marco Primi, Fernando Pedone
2012 IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)  
In addition to presenting Multi-Ring Paxos, we describe a prototype of the system we have implemented and a detailed evaluation of its performance.  ...  By scalability we mean the ability to increase the throughput of a group communication protocol, measured in number of requests ordered per time unit, by adding resources (i.e., nodes).  ...  ACKNOWLEDGEMENTS We wish to thank Carlos Eduardo Bezerra, Daniele Sciascia, and the anonymous reviewers for their help and suggestions to improve the paper.  ... 
doi:10.1109/dsn.2012.6263916 dblp:conf/dsn/MarandiPP12 fatcat:4lzrhmssjfgxdcobjcvrv7euuu

Ring Paxos: High-Throughput Atomic Broadcast [article]

Parisa Jalili Marandi, Marco Primi, Nicolas Schiper, Fernando Pedone
2014 arXiv   pre-print
The paper presents two protocols, M-Ring Paxos and U-Ring Paxos, derived from Paxos. The protocols inherit the properties of Paxos and can be implemented very efficiently.  ...  We report a detailed performance analysis of M-Ring Paxos and U-Ring Paxos and compare them to other atomic broadcast protocols.  ...  The authors would like to thank Antonio Carzaniga, Leslie Lamport, and Robbert van Renesse for the valuable discussions about Ring Paxos.  ... 
arXiv:1401.6015v1 fatcat:bccak4pnsbeldppquhbja4mxai

The Paxos Register

Harry C. Li, Allen Clement, Amitanand S. Aiyer, Lorenzo Alvisi
2007 Symposium on Reliable Distributed Systems. Proceedings  
We introduce the Paxos register to simplify and unify the presentation of Paxos-style consensus protocols.  ...  We encapsulate the differences of several Paxos-style protocols in the implementation details of these abstractions.  ...  Lampson describes Abstract Paxos [16] , a version of Lamport's original protocol, and derives Classic Paxos, Byzantine Paxos, and Disk Paxos [11] from it.  ... 
doi:10.1109/srds.2007.4365689 fatcat:ns2bc5o5kvg7bhszx32qci7tey

The Paxos Register

Harry C. Li, Allen Clement, Amitanand S. Aiyer, Lorenzo Alvisi
2007 2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)  
We introduce the Paxos register to simplify and unify the presentation of Paxos-style consensus protocols.  ...  We encapsulate the differences of several Paxos-style protocols in the implementation details of these abstractions.  ...  Lampson describes Abstract Paxos [16] , a version of Lamport's original protocol, and derives Classic Paxos, Byzantine Paxos, and Disk Paxos [11] from it.  ... 
doi:10.1109/srds.2007.32 dblp:conf/srds/LiCAA07 fatcat:7y7kz37ylbbk5ew6doozwpqvxq

ScalienDB: Designing and Implementing a Distributed Database using Paxos [article]

Márton Trencséni, Attila Gazsó
2013 arXiv   pre-print
ScalienDB is a scalable, replicated database built on top of the Paxos algorithm. It was developed from 2010 to 2012, when the startup backing it failed.  ...  This paper discusses the design decisions of the distributed database, describes interesting parts of the C++ codebase and enumerates lessons learned putting ScalienDB into production at a handful of clients  ...  correctness of all this, which if broken potentially leads to data loss.  ... 
arXiv:1302.3860v1 fatcat:rdjcba73nvdctaa6tisflqafpy

Byzantine disk paxos

Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi
2004 Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04  
We present Byzantine Disk Paxos, an asynchronous sharedmemory consensus protocol that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arbitrarily corrupted.  ...  The second flavor is given by today's peer-to-peer systems. These systems consist of a collection of nodes spread all over the Internet that store data objects.  ...  The result is an efficient and simple adaptation of Disk Paxos, which tolerates NR-Arbitrary faults of up to a third of the disks.  ... 
doi:10.1145/1011767.1011801 dblp:conf/podc/AbrahamCKM04 fatcat:e6stixp2vram7nsacirgegv75m

Byzantine disk paxos: optimal resilience with byzantine shared memory

Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi
2005 Distributed computing  
We present Byzantine Disk Paxos, an asynchronous sharedmemory consensus protocol that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arbitrarily corrupted.  ...  SAN allows clients to access disks directly over the network so that the file server bottleneck is eliminated.  ...  The result is an efficient and simple adaptation of Disk Paxos, which tolerates NR-Arbitrary faults of up to a third of the disks.  ... 
doi:10.1007/s00446-005-0151-6 fatcat:fh7wvi4furhqzgkapcdixasrmy

Developing Correctly Replicated Databases Using Formal Tools

Nicolas Schiper, Vincent Rahli, Robbert Van Renesse, Marck Bickford, Robert L. Constable
2014 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks  
This paper describes our experience with building highlyavailable databases using replication protocols that were generated with the help of correct-by-construction formal methods.  ...  The goal of our project is to obtain databases with unsurpassed reliability while providing good performance.  ...  This specification is refined to Haskell code before being refined a second time to a subset of C. To show the correctness of their implementation, the authors prove that the refinements are correct.  ... 
doi:10.1109/dsn.2014.45 dblp:conf/dsn/SchiperRRBC14 fatcat:oraoyadqurfpbjqwuyvcps67wq

Partitioned Paxos via the Network Data Plane [article]

Huynh Tu Dang, Pietro Bressana, Han Wang, Ki Suh Lee, Noa Zilberman, Hakim Weatherspoon, Marco Canini, Fernando Pedone, Robert Soulé
2019 arXiv   pre-print
The key insight behind Partitioned Paxos is to separate the two aspects of Paxos, agreement, and execution, and optimize them separately.  ...  a replicated instance of a RocksDB key-value store.  ...  Correctness Given this alternative interpretation of the Paxos algorithm, it is natural to question if this is a faithful implementation of the original protocol [24] .  ... 
arXiv:1901.08806v1 fatcat:d3ojtu2knfhgzoivz4zz7noxsi

A History of the Virtual Synchrony Replication Model [chapter]

Ken Birman
2010 Lecture Notes in Computer Science  
: six papers are concerned with Paxos, and another three with transactional mechanisms, and beyond those nine, others explore consistency and correctness after failures.  ...  A version of CAP was soon proved in a paper by Gilbert and Lynch [9], although for a fairly narrow scenario.  ...  I also want to express gratitude to the agencies that have recently funded my work, notably DARPA, NSF and DOE.  ... 
doi:10.1007/978-3-642-11294-2_6 fatcat:3zm4nmix4vf6tnjznjqpaltpfi

Flease - Lease Coordination Without a Lock Server

Bjorn Kolbeck, Mikael Högqvist, Jan Stender, Felix Hupfeld
2011 2011 IEEE International Parallel & Distributed Processing Symposium  
The evaluation shows that FLEASE can be used to implement scalable, decentralized lease coordination that outperforms a central lock service implementation by an order of magnitude.  ...  Large-scale distributed systems often require scalable and fault-tolerant mechanisms to coordinate exclusive access to shared resources such as files, replicas or the primary role.  ...  The research leading to these results has received funding from the European Union Seventh Framework Programme under grant agreement FP7-ICT-257438.  ... 
doi:10.1109/ipdps.2011.94 dblp:conf/ipps/KolbeckHSH11 fatcat:alp7sww4e5hrnln5ij7ks24o3e

Using Paxos to build a scalable, consistent, and highly available datastore

Jun Rao, Eugene J. Shekita, Sandeep Tata
2011 Proceedings of the VLDB Endowment  
The use of Paxos ensures that a data partition in Spinnaker will be available for reads and writes as long a majority of its replicas are alive.  ...  Unlike traditional master-slave replication, this is true regardless of the failure sequence that occurs.  ...  Multi-Paxos is a well known optimization of Paxos when a sequence of values are being submitted to the group.  ... 
doi:10.14778/1938545.1938549 fatcat:zner6bguwnh3bmwjapfwcmf77a
« Previous Showing results 1 — 15 out of 309 results