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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 20; H. 3; S. 419 - 432
Hauptverfasser:	Bessani, A.N., Correia, M., da Silva Fraga, J., Lau Cheuk Lung
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.03.2009 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!