| Abstract
|
In the last decade there has been a large … In the last decade there has been a large body of work
in how to make Byzantine fault-tolerant (BFT) systems
more practical. Most of these works aim to provide
efficient implementations of abstractions such as state
machine replication, consensus and read-write registers.
These abstractions are well regarded as important building
blocks to architect dependable distributed systems.
In this paper we advocate the idea of using a new
abstraction for programming dependable systems: the
coordination service. The idea is to have one or more
shared memory objects providing some synchronization
power that allows distributed problems to be solved. The
final objective is to make dependable services programming
more simple. pendable services programming
more simple.
|
| Author
|
François Aubry +
, Alysson Bessani +
, Paulo Sousa +
|
| Booktitle
|
Proceedings of the 39th IEEE International Conference on Dependable Systems and Networks (DSN 2009) - Fast Abstract, Estoril, Portugal, Jun-Jul 2009. +
|
| Key
|
Francois-aubry2009bft-services-227 +
|
| Month
|
jun +
|
| NumPubDate
|
2,009.06 +
|
| ResearchLine
|
Fault And Intrusion Tolerance in Open Distributed Systems (FIT) +
|
| Title
|
BFT Services Programming with a Dependable Tuple Space +
|
| Type
|
inproceedings +
|
| Url
|
http://www.navigators.di.fc.ul.pt/archive/papers/aubry09bft.pdf +
|
| Year
|
2009 +
|
| Categories |
Publication +
|
| Modification dateThis property is a special property in this wiki.
|
14 January 2013 14:41:06 +
|
