Distributed Computing
From MaRDI portal
Publication:5395148
DOI10.1007/11561927zbMath1171.68379OpenAlexW4245215744MaRDI QIDQ5395148
Lidong Zhou, Florian Oprea, Dahlia Malkhi
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561927
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Network protocols (68M12)
Related Items (11)
The Theta-Model: achieving synchrony without clocks ⋮ The Heard-Of model: computing in distributed systems with benign faults ⋮ On implementing omega in systems with weak reliability and synchrony assumptions ⋮ A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems ⋮ Partial synchrony based on set timeliness ⋮ Failure detectors encapsulate fairness ⋮ When consensus meets self-stabilization ⋮ Communication-optimal eventually perfect failure detection in partially synchronous systems ⋮ The asynchronous bounded-cycle model ⋮ A simple and communication-efficient omega algorithm in the crash-recovery model ⋮ Packet efficient implementation of the Omega failure detector
This page was built for publication: Distributed Computing
