Efficiency of semisynchronous versus asynchronous networks

DOI10.1007/BF01191625zbMath0812.68078MaRDI QIDQ4311637

Hagit Attiya, Marios Mavronicolas

Publication date: 30 October 1994

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

asynchronous network\(s\)-session problemsemisynchronous networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (6)

Time bounds on synchronization in a periodic distributed system ⋮ Improved time bounds for linearizable implementations of abstract data types ⋮ Hundreds of impossibility results for distributed computing ⋮ Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory ⋮ Sequentially consistent versus linearizable counting networks ⋮ Rapid convergence of a local load balancing algorithm for asynchronous rings

Cites Work

• Using mappings to prove timing properties
• Time bounds for real-time process control in the presence of timing uncertainty
• Distributed network protocols
• Efficiency of Synchronous Versus Asynchronous Distributed Systems
• Complexity of network synchronization
• Asynchronous Iterative Methods for Multiprocessors
• Bounds on the time to reach agreement in the presence of timing uncertainty
• The impact of time on the session problem

This page was built for publication: Efficiency of semisynchronous versus asynchronous networks