Efficiency of Synchronous Versus Asynchronous Distributed Systems
From MaRDI portal
Publication:3763580
Recommendations
- Complexity of network synchronization
- Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory
- Efficiency of semisynchronous versus asynchronous networks
- Synchronous, asynchronous, and causally ordered communication
- Clock construction in fully asynchronous parallel systems and PRAM simulation
Cited in
(17)- Efficiency of semisynchronous versus asynchronous networks
- Making local algorithms wait-free: the case of ring coloring
- scientific article; zbMATH DE number 1875365 (Why is no real title available?)
- Time bounds on synchronization in a periodic distributed system
- Hundreds of impossibility results for distributed computing
- Improved time bounds for linearizable implementations of abstract data types
- Clock construction in fully asynchronous parallel systems and PRAM simulation
- scientific article; zbMATH DE number 2061545 (Why is no real title available?)
- Rapid convergence of a local load balancing algorithm for asynchronous rings
- A complexity theory of efficient parallel algorithms
- Phase transition between synchronous and asynchronous updating algorithms
- A framework for viewing atomic events in distributed computations
- Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory
- Asynchronous and corrected-asynchronous finite difference solutions of PDEs on MIMD multiprocessors
- Formal Modeling and Analysis of Timed Systems
- scientific article; zbMATH DE number 7407798 (Why is no real title available?)
- Efficient simulation of synchronous systems by multi-speed systems
This page was built for publication: Efficiency of Synchronous Versus Asynchronous Distributed Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763580)
