| Abstract
|
Despite the large amount of Byzantine faul … 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 require less shared memory operations, using also less memory bits than previous algorithms based on 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. ree and wait-free universal constructions.
|
| Author
|
Alysson Bessani +
, Miguel Correia +
, Joni Fraga +
, Lau Cheuk Lung +
|
| Journal
|
IEEE Transactions on Parallel and Distributed Systems. Vol. 20 no. 3. pp. 419-43. IEEE Computer Society. March 2009. +
|
| Key
|
Bessani09tpds +
|
| Month
|
mar +
|
| NumPubDate
|
2,009.03 +
|
| Project
|
Project:CRUTIAL +
|
| ResearchLine
|
Fault And Intrusion Tolerance in Open Distributed Systems (FIT) +
|
| Title
|
Sharing Memory between Byzantine Processes using Policy-Enforced Tuple Spaces +
|
| Type
|
article +
|
| Url
|
http://www.navigators.di.fc.ul.pt/archive/papers/tpds09-peats___.pdf +
|
| Year
|
2009 +
|
| Categories |
Publication +
|
| Modification dateThis property is a special property in this wiki.
|
14 January 2013 14:41:08 +
|
