Distributed computing in the asynchronous LOCAL model

DOI10.1016/J.TCS.2024.114952MaRDI QIDQ6652468zbMATH OpenFDO

Authors Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikaël Rabie

Publication date 12 December 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

fault toleranceasynchronylocalitydistributed network computing

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• What Can be Computed Locally?
• Making local algorithms wait-free: the case of ring coloring
• Making local algorithms wait-free: the case of ring coloring
• SOFSEM 2005: Theory and Practice of Computer Science
• Renaming in an asynchronous environment

Cites work

• An Optimal Synchronizer for the Hypercube
• An optimal distributed (+1)-coloring algorithm?
• Best of two local models: centralized local and distributed local algorithms
• Complexity of network synchronization
• Deterministic coin tossing with applications to optimal parallel list ranking
• Distributed Computing: A Locality-Sensitive Approach
• Distributed \((\Delta+1)\)-coloring in sublogarithmic rounds
• Distributed algorithms for the Lovász local lemma and graph coloring
• Exact bounds for distributed graph colouring
• Impossibility of distributed consensus with one faulty process
• Improved deterministic distributed matching via rounding
• Locality in Distributed Graph Algorithms
• Locally-iterative distributed \((\Delta+1)\)-coloring below Szegedy-Vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models
• Making local algorithms wait-free: the case of ring coloring
• On the complexity of local distributed graph problems
• On the minimal synchronism needed for distributed consensus
• On the power of the congested clique model
• Polynomial lower bound for distributed graph coloring in a weak LOCAL model
• Survey of local algorithms
• Weak models of distributed computing, with connections to modal logic
• What Can be Computed Locally?

This page was built for publication: Distributed computing in the asynchronous LOCAL model

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