Sharing Memory between Byzantine Processes Using Policy-Enforced Tuple Spaces

Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes subject to Byzantine failures using shared memory have appeared. This paper presents a new computing model in which share...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems Vol. 20; no. 3; pp. 419 - 432
Main Authors: Bessani, A.N., Correia, M., da Silva Fraga, J., Lau Cheuk Lung
Format: Journal Article
Language:English
Published: New York IEEE 01.03.2009
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Access control
Access controls
Algorithm design and analysis
Algorithms
Availability
Computation
Computer hacking
Construction
Distributed programming
Distributed systems
Fault tolerance
Fault tolerant systems
Lists
Lungs
Parallelism and concurrency
Peat
Policies
Protection
Registers
Resilience
Parallelism and concurrency
Distributed programming
Fault-tolerance
Access controls
Distributed systems
ISSN:1045-9219, 1558-2183
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes subject to Byzantine failures using shared memory have appeared. This paper presents a new computing model in which shared memory objects are protected by fine-grained access policies, and a new shared memory object, the policy-enforced augmented tuple space (PEATS). We show the benefits of this model by providing simple and efficient consensus algorithms. These algorithms are much simpler and requires less shared memory operations, using also less memory bits than previous algorithms based on access control lists ACLs and sticky bits. We also prove that PEATS objects are universal, i.e., that they can be used to implement any other shared memory object, and present lock-free and wait-free universal constructions.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2008.96