Efficiency of semisynchronous versus asynchronous networks

DOI10.1007/BF01191625MaRDI QIDQ4311637zbMATH OpenFDO

Authors Hagit Attiya, Marios Mavronicolas

Publication date 30 October 1994

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

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

zbMATH Keywords

\(s\)-session problemasynchronous networksemisynchronous 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)

Recommendations

• Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory
• Efficiency of Synchronous Versus Asynchronous Distributed Systems
• The impact of time on the session problem
• The Impact of Timing Knowledge on the Session Problem
• Two lower bounds in asynchronous distributed computation

Cites work

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

Cited in

(12)

• Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory
• Rapid convergence of a local load balancing algorithm for asynchronous rings
• Improved time bounds for linearizable implementations of abstract data types
• Highly concurrent logically synchronous multicast
• Time bounds on synchronization in a periodic distributed system
• Efficiency of Synchronous Versus Asynchronous Distributed Systems
• scientific article; zbMATH DE number 4050992 (Why is no real title available?)
• The Impact of Timing Knowledge on the Session Problem
• Hundreds of impossibility results for distributed computing
• Sequentially consistent versus linearizable counting networks
• The asynchronous committee meeting problem
• The asynchronous bounded-cycle model

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

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