Efficiency of semisynchronous versus asynchronous networks
From MaRDI portal
Publication:4311637
DOI10.1007/BF01191625zbMath0812.68078MaRDI QIDQ4311637
Hagit Attiya, Marios Mavronicolas
Publication date: 30 October 1994
Published in: Mathematical Systems Theory (Search for Journal in Brave)
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
68W15: Distributed algorithms
Related Items
Hundreds of impossibility results for distributed computing, Sequentially consistent versus linearizable counting networks, Time bounds on synchronization in a periodic distributed system, 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
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