paxos   862

« earlier    

Seamless Paxos Coordinators
The Paxos algorithm requires a single correct coordinator process to operate. After a failure, the replacement of the coordinator may lead to a temporary unavailability of the application implemented atop Paxos. So far, this unavailability has been addressed by reducing the coordinator replacement rate through the use of stable coordinator selection algorithms. We have observed that the cost of recovery of the newly elected coordinator's state is at the core of this unavailability problem. In this paper we present a new technique to manage coordinator replacement that allows the recovery to occur concurrently with new consensus rounds. Experimental results show that our seamless approach effectively solves the temporary unavailability problem, its adoption entails uninterrupted execution of the application. Our solution removes the restriction that the occurrence of coordinator replacements is something to be avoided, allowing the decoupling of the application execution from the accuracy of the mechanism used to choose a coordinator. This result increases the performance of the application even in the presence of failures, it is of special importance to the autonomous operation of replicated applications that have to adapt to varying network conditions and partial failures.
paxos  consensus  protocol 
5 days ago by mpm
22 days ago by cdpath
Michael Whittaker - Single-Decree Paxos
Paxos is an algorithm which maintains a distributed, consistent log shared by a set of networked computers. Single-Decree Paxos is a slightly simpler algorithm that solves consensus and is used to implement Paxos.
paxos  description  algorithm  distributed  distributedsystems 
july 2017 by kybernetikos
Elastic Paxos: A Dynamic Atomic Multicast Protocol
Replication is a common technique used to design reliable distributed systems by masking defective components. To cope with the requirements of modern Internet applications, replication protocols must allow for throughput scalability and dynamic reconfiguration, that is, on-demand replacement or provisioning of system resources. This paper describes Elastic Paxos, a new dynamic atomic multicast protocol that fulfills these requirements. Elastic Paxos allows to dynamically add and remove resources to an online partially replicated state machine. We implemented Elastic Paxos and evaluated its performance in OpenStack, a cloud environment. We demonstrate its practicality to dynamically scale up and down a partially replicated data store with itand to reconfigure a distributed system.
paxos  broadcast 
july 2017 by mpm

« earlier    

related tags

2015  2017  abhishekverma  acm  actors  alfraniocorreia  algor  algorithm  algorithms  architecture  availability  beginner  bigdata  blog  blogs  broadcast  clojure  cluster_mgmt  clustering  compare  complexity  computer  concurrency  concurrent  consensus  consistency  coordination  database  davidoppenheimer  description  development  discussion  distributed-computing  distributed-system  distributed-systems  distributed  distributed_computing  distributed_systems  distributedsystems  dlt  education  erictune  erlang  explanation  frp  golang  google  google_borg  greece  groupreplication  grpc  gryadka  hacker-news-comments  hackernews  implementation  infrastructure  interesting  interestingpapers  java  johnwilkes  jvm  kafka  lamport  lecture  leslie  linkedin  luispedrosa  madhukarrkorupolu  mit  multicast  mysql  network  networking  nopaxos  paper  papers  pdf  performance  programming  protocol  pseudo-code  python  raft  read  reference  replication  riak  rust  scaling  science  software  synchronization  system  systems  testing  tla  tr-2017-03  trex  tutorial  write  xcom  zab  分布式 

Copy this bookmark: