The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2009 vol.20)
pp: 419-432
Alysson Neves Bessani , Faculdade de Cieências da Universidade de Lisboa, Lisboa
Miguel Correia , Faculdade de Cieências da Universidade de Lisboa, Lisboa
Joni da Silva Fraga , Universidade Federal de Santa Catarina, Florianópolis
Lau Cheuk Lung , Universidade Federal de Santa Catarina, Florianópolis
ABSTRACT
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 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.
INDEX TERMS
Distributed programming, Fault-tolerance, Access controls, Distributed systems, Parallelism and concurrency
CITATION
Alysson Neves Bessani, Miguel Correia, Joni da Silva Fraga, Lau Cheuk Lung, "Sharing Memory between Byzantine Processes Using Policy-Enforced Tuple Spaces", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 3, pp. 419-432, March 2009, doi:10.1109/TPDS.2008.96
REFERENCES
[1] M. Abd-El-Malek, G. Ganger, G. Goodson, M. Reiter, and J. Wylie, “Fault-Scalable Byzantine Fault-Tolerant Services,” Proc. 20th ACM Symp. Operating Systems Principles (SOSP '05), pp. 59-74, Oct. 2005.
12 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool