Efficiency of Synchronous Versus Asynchronous Distributed Systems

DOI10.1145/2402.322387zbMath0627.68025OpenAlexW2079002298MaRDI QIDQ3763580

Michael J. Fischer, Eshrat Arjomandi, Nancy A. Lynch

Publication date: 1983

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2402.322387

zbMATH Keywords

clock

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Time bounds on synchronization in a periodic distributed system ⋮ Improved time bounds for linearizable implementations of abstract data types ⋮ A framework for viewing atomic events in distributed computations ⋮ Efficiency of semisynchronous versus asynchronous networks ⋮ A complexity theory of efficient parallel algorithms ⋮ Hundreds of impossibility results for distributed computing ⋮ Phase transition between synchronous and asynchronous updating algorithms ⋮ Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory ⋮ Making local algorithms wait-free: the case of ring coloring ⋮ Rapid convergence of a local load balancing algorithm for asynchronous rings ⋮ Unnamed Item ⋮ Asynchronous and corrected-asynchronous finite difference solutions of PDEs on MIMD multiprocessors