Brief announcement: decoupled quorum-based byzantine-resilient coordination in open distributed systems

Authors:
Alysson Neves Bessani;Miguel Correia;Joni da Silva Fraga;Lau Cheuk Lung
Affiliations:
,DAS/PGEEL, Universidade Federal de Santa Catarina, Brazil;LaSIGE, Faculdade de Ciências da Universidade de Lisboa, Portugal;DAS/PGEEL, Universidade Federal de Santa Catarina, Brazil;PPGIA, Pontificia Universidade Católica do Paraná, Brazil
Venue:
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Year:
2006

Citing 4
Cited 0

Generative communication in Linda

ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical byzantine fault tolerance and proactive recovery

ACM Transactions on Computer Systems (TOCS)
Minimal Byzantine Storage

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Byzantine quorum systems

Distributed Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The tuple space coordination model, originally introduced in the Linda programming language [2], uses a shared memory object called a tuple space to support coordination that is decoupled both in time – processes do not have to be active at the same time – and space – processes do not need to know each others' addresses. The tuple space can be considered to be a kind of storage that stores tuples, i.e. finite sequences of values. The operations supported are essentially three: inserting a tuple in the space, reading a tuple from the space and removing a tuple from the space.