Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,293,701 papers from all fields of science
Search
Sign In
Create Free Account
State machine replication
In computer science, state machine replication or state machine approach is a general method for implementing a fault-tolerant service by replicating…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Byzantine fault tolerance
Computer science
Consensus (computer science)
Finite-state machine
Expand
Broader (1)
Data synchronization
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Dynamic Adaptation of Byzantine Fault Tolerant Protocols
Carlos Carvalho
,
carlosacarvalho
2017
Corpus ID: 5927060
The problem of distributed consensus in the presence of Byzantine faults has received particular attention in recent decades…
Expand
2016
2016
Reconfigurable Scalable State Machine Replication
D. Böger
,
J. Fraga
,
E. Alchieri
Latin-American Symposium on Dependable Computing
2016
Corpus ID: 15058031
Existing works on the scalability of State Machine Replication mostly rely on partitioning the application state in order to…
Expand
2015
2015
A Multi-leader Approach to Byzantine Fault Tolerance : Achieving Higher Throughput Using Concurrent Consensus
Muhammad Zeeshan Abid
2015
Corpus ID: 59316012
Byzantine Fault Tolerant protocols are complicated and hard to implement.Today’s software industry is reluctant to adopt these…
Expand
2012
2012
A PAXOS based State Machine Replication System for Anomaly Detection
M. Thakur
,
S. Sanyal
arXiv.org
2012
Corpus ID: 7172180
A number of systems in recent times suffer from attacks like DDoS and Ping of Death. Such attacks result in loss of critical…
Expand
2010
2010
State machine replication for wide area networks
Yanhua Mao
2010
Corpus ID: 11543987
State machine replication is the most general approach for providing highly available services with strong consistency guarantees…
Expand
2010
2010
Generalizing State Machine Replication
E. Gafni
,
R. Guerraoui
2010
Corpus ID: 60873938
We show that, with k-set consensus, any number of processes can emulate k state machines of which at least one progresses. This…
Expand
2010
2010
A framework for managing multiprocess applications based on distributed finite-state machine approach
M. Antolini
,
M. Covarrubias
,
M. Bordegoni
,
U. Cugini
19th International Symposium in Robot and Human…
2010
Corpus ID: 235549
This paper describes a framework based on a publish/subscribe paradigm for interprocess communication based on XML messages sent…
Expand
2007
2007
Large-scale byzantine fault tolerance: safe but not always live
R. Rodrigues
,
Petr Kouznetsov
,
Bobby Bhattacharjee
2007
Corpus ID: 17652292
The overall correctness of large-scale systems composed of many groups of replicas executing BFT protocols scales poorly with the…
Expand
2005
2005
Tolerating Arbitrary Failures with State Machine Replication
A. Doudou
,
B. Garbinato
,
R. Guerraoui
2005
Corpus ID: 58779379
The growing reliance, in our daily lives, on services provided by distributed applications (e.g., air-traffic control, public…
Expand
2004
2004
A performance evaluation of a quorum-based state-machine replication algorithm for computing grids
Jean-Michel Busca
,
M. Bertier
,
F. Belkouch
,
Pierre Sens
,
Luciana Arantes
Symposium on Computer Architecture and High…
2004
Corpus ID: 15829553
Quorum systems are well-known tools that improve the performance and the availability of distributed systems. In this paper we…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE