Unbounded Speed Variability in Distributed Communications Systems

DOI10.1137/0214005zbMATH Open0552.68025OpenAlexW2086012279MaRDI QIDQ3345762FDOQ3345762

Authors: J. Reif, P. G. Spirakis 

Publication date: 1985

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0214005

Recommendations

• Real-Time Synchronization of Interprocess Communications
• A clock synchronization problem with random delays
• The use of a synchronizer yields the maximum computation rate in distributed networks
• Bounds on the time to reach agreement in the presence of timing uncertainty
• Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability

zbMATH Keywords

randomized algorithmssynchronizationdistributed networksprobabilistic choicecommunicating sequential processeshandshake communicationreal-time response

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cited In (4)

• Adding Time to Synchronous Process Communications
• Real-Time Synchronization of Interprocess Communications
• A glimpse at Paul G. Spirakis
• Efficient distributed algorithms by using the archimedean time assumption

This page was built for publication: Unbounded Speed Variability in Distributed Communications Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3345762)