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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on parallel and distributed systems Ročník 20; číslo 3; s. 419 - 432
Hlavní autori:	Bessani, A.N., Correia, M., da Silva Fraga, J., Lau Cheuk Lung
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.03.2009 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!