Efficient distributed algorithms by using the archimedean time assumption

DOI10.1051/ita/1989230101131zbMath0665.68032OpenAlexW11916716MaRDI QIDQ3816977

B. Tampakas, Paul G. Spirakis

Publication date: 1989

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92320

zbMATH Keywords

time complexitymutual exclusiondistributed computationmessage complexitysynchronous networksArchimedean networkslimited asynchronylogical ringreaders and writerssymmetry breaking problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Related Items (1)

On the Microscopic View of Time and Messages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real-Time Synchronization of Interprocess Communications
• Unbounded Speed Variability in Distributed Communications Systems
• Concurrent reading and writing
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: Efficient distributed algorithms by using the archimedean time assumption