Reconfiguring Parallel State Machine Replication

Alchieri, Eduardo; Dotti, Fernando Luís; Mendizabal, Odorico Machado; Pedone, Fernando

doi:10.1109/srds.2017.23

Cited by 33 publications

(25 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Reconfiguration of distributed systems have been extensively studied in the past as it finds applications in cluster membership changes, atomic storage, file systems, replicated state machines, and rolling upgrades . The most common types of reconfigurable services are atomic storage that supports reads and writes and replicated state machine that supports generic commands, like transactions …”

Section: Related Workmentioning

confidence: 99%

ComChain: A blockchain with Byzantine fault‐tolerant reconfiguration

Vizier

Gramoli

2019

Concurrency and Computation

View full text Add to dashboard Cite

Selecting which blockchain participants can decide upon a new block is a difficult problem.Consortium blockchains need the participants to be predetermined while public blockchains incentivize all participants to waste their resources to decide every block. In this paper, we introduce the community blockchain that allows potentially all participants to decide upon ''some'' block while restricting the set of participants deciding upon ''one'' block. To this end, we propose a blockchain reconfiguration, a Byzantine consensus protocol that allows to dynamically change the set of blockchain participants deciding upon the upcoming blocks. The resulting blockchain, called ComChain, is resilience optimal and transitions through different configurations of participants recorded in dedicated blocks so that each configuration decides upon its subsequent transaction blocks. We evaluate an implementation that adds reconfiguration to the Red Belly Blockchain and demonstrates its practical performance in a distributed system.

show abstract

Section: Related Workmentioning

confidence: 99%

ComChain: A blockchain with Byzantine fault‐tolerant reconfiguration

Vizier

Gramoli

2019

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…In both cases, clients tag requests with the ids of the worker threads that will execute the requests. In [1], a scheduler thread delivers requests in total order and assigns each request to the worker responsible for the execution of the request. In [24], there is no scheduler involved; the atomic broadcast primitive uses the request tag to deliver requests directly to worker threads at the replicas.…”

Section: Early Schedulingmentioning

confidence: 99%

“…We adopt the following replica execution model, which extends the more restrictive model proposed in [1]:…”

Section: Replica Execution Modelmentioning

confidence: 99%

See 1 more Smart Citation

Early Scheduling in Parallel State Machine Replication

Alchieri

Dotti

Pedone

2018

Proceedings of the ACM Symposium on Cloud Computing

Self Cite

View full text Add to dashboard Cite

State machine replication is standard approach to fault tolerance. One of the key assumptions of state machine replication is that replicas must execute operations deterministically and thus serially. To benefit from multi-core servers, some techniques allow concurrent execution of operations in state machine replication. Invariably, these techniques exploit the fact that independent operations (those that do not share any common state or do not update shared state) can execute concurrently. A promising category of solutions trades scheduling freedom for simplicity. This paper generalizes this category of scheduling solutions. In doing so, it proposes an automated mechanism to schedule operations on worker threads at replicas. We integrate our contributions to a popular state machine replication framework and experimentally compare the resulting system to more classic approaches.

show abstract

“…Dois comandos são ditos não conflitantes caso a escrita de um não ocorra no mesmo dado em que a leitura ou escrita do outro, caso contrário são conflitantes. Para maximizar o ganho de desempenho, faz-se necessário explorar o balanceamento do trabalho entre as threads, assim como minimizar o impacto causado pela necessidade de sincronização que se dá pela existência de comandos conflitantes [7].…”

Section: Introductionunclassified

Proposta para Reparticionamento de Estado em Replicação Máquina de Estado Paralela

Trombeta¹,

Mendizabal²

2020

Anais Do XI Computer on the Beach - COTB '20

View full text Add to dashboard Cite

State Machine Replication is a widely used technique to providefault tolerance and strong consistency. In this approach, all commandsare executed sequentially throughout the replicas. Aimingto improve the system’s throughput, enhanced versions were proposed,where independent commands can be executed in parallel.One arising challenge, though, is how to balance the workload betweenthreads, while avoiding the need of synchronization betweenthem. This extended abstract proposes a technique to schedule requestsin a dynamic and efficient manner, using a workload graph tokeep track of access patterns and graph partitioning to decomposeand dispatch workload to the worker threads.

show abstract

Reconfiguring Parallel State Machine Replication

Cited by 33 publications

References 26 publications

ComChain: A blockchain with Byzantine fault‐tolerant reconfiguration

ComChain: A blockchain with Byzantine fault‐tolerant reconfiguration

Early Scheduling in Parallel State Machine Replication

Proposta para Reparticionamento de Estado em Replicação Máquina de Estado Paralela

Contact Info

Product

Resources

About