Possibility and impossibility results in a shared memory environment

DOI10.1007/s002360050034zbMath0835.68037OpenAlexW2023880298MaRDI QIDQ1901689

Shlomo Moran, Gadi Taubenfeld

Publication date: 19 November 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050034

zbMATH Keywords

shared memorycrash failureswinning strategyimpossibilityasynchronous protocolsatomic read and write operations

Mathematics Subject Classification ID

Related Items (6)

Initial failures in distributed computations ⋮ Hundreds of impossibility results for distributed computing ⋮ A closer look at fault tolerance ⋮ Contention-sensitive data structures and algorithms ⋮ Leader election in the presence of n-1 initial failures ⋮ Computing in totally anonymous asynchronous shared memory systems

Cites Work

• Unnamed Item
• Unnamed Item
• Initial failures in distributed computations
• How processes learn
• Impossibility results in the presence of multiple faulty processes
• Leader election in the presence of n-1 initial failures
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus

This page was built for publication: Possibility and impossibility results in a shared memory environment