Conference Papers Year : 2019

Brief Announcement: Distributed Computing in the Asynchronous {LOCAL} Model

Abstract

We show that, for any task T associated to a locally checkable labeling (lcl), if T is solvable in t rounds by a deterministic algorithm in the local model, then T remains solvable by a deterministic algorithm in O(t) rounds in an asynchronous variant of the local model whenever t=O(polylogn).
No file

Dates and versions

hal-02436289 , version 1 (12-01-2020)

Identifiers

Cite

Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Mikael Rabie. Brief Announcement: Distributed Computing in the Asynchronous {LOCAL} Model. SSS 2019 - 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, Oct 2019, Pisa, Italy. ⟨10.1007/978-3-030-34992-9_9⟩. ⟨hal-02436289⟩
67 View
0 Download

Altmetric

Share

More