Time-adaptive algorithms for synchronization

DOI10.1145/195058.195464MaRDI QIDQ2817676zbMATH OpenOpenAlexFDO

Authors Hagit Attiya, Gadi Taubenfeld, Rajeev Alur

Publication date 1 September 2016

Published in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Time-Adaptive Algorithms for Synchronization
• Bounded Concurrent Time-Stamping
• Fast timing-based algorithms
• Time bounds for mutual exclusion and related problems
• Time/contention trade-offs for multiprocessor synchronization

Cited in

(5)

• Fast timing-based algorithms
• Time bounds on synchronization in a periodic distributed system
• Adaptive timeliness of consensus in presence of crash and timing faults
• Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory
• Algorithm of simulation time synchronization over large-scale nodes

This page was built for publication: Time-adaptive algorithms for synchronization

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