Brief Announcement: Distributed Computing in the Asynchronous {LOCAL} Model
Résumé
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).