Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Stabilizing, Safety, and Security of Distributed Systems

SSS 2019: Stabilization, Safety, and Security of Distributed Systems pp 105–110Cite as

Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11914))

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(\text {polylog}\, n)\).

This research is supported by the ANR project DESCARTES (ref. DS0702-2016). Additional support from the INRIA project GANG.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Awerbuch, B.: Complexity of network synchronization. J. ACM 32(4), 804–823 (1985)

    Article  MathSciNet  Google Scholar 

  2. Awerbuch, B., Peleg, D.: Network synchronization with polylogarithmic overhead. In: 31st Symposium on Foundations of Computer Science (FOCS), pp. 514–522 (1990)

    Google Scholar 

  3. Castañeda, A., Delporte, C., Fauconnier, H., Rajsbaum, S., Raynal, M.: Making local algorithms wait-free: the case of ring coloring. Theory Comput. Syst. 63(2), 344–365 (2019)

    Article  MathSciNet  Google Scholar 

  4. Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Inf. Control 70(1), 32–53 (1986)

    Article  MathSciNet  Google Scholar 

  5. Delporte-Gallet, C., Fauconnier, H., Fraigniaud, P., Rabie, M.: Distributed computing in the asynchronous LOCAL model. CoRR abs/1904.07664 (2019)

    Google Scholar 

  6. Drucker, A., Kuhn, F., Oshman, R.: On the power of the congested clique model. In 33rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 367–376 (2014)

    Google Scholar 

  7. Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)

    Article  MathSciNet  Google Scholar 

  8. Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193–201 (1992)

    Article  MathSciNet  Google Scholar 

  9. Naor, M., Stockmeyer, L.J.: What can be computed locally? SIAM J. Comput. 24(6), 1259–1277 (1995)

    Article  MathSciNet  Google Scholar 

  10. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)

    Book  Google Scholar 

  11. Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Comput. 18(4), 740–747 (1989)

    Article  MathSciNet  Google Scholar 

  12. Rybicki, J., Suomela, J.: Exact bounds for distributed graph colouring. In 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 46–60 (2015)

    Chapter  Google Scholar 

  13. Suomela, J.: Survey of local algorithms. ACM Comput. Surv. 45(2), 24:1–24:40 (2013)

    Article  Google Scholar 

  14. Szegedy, M., Vishwanathan, S.: Locality based graph coloring. In: 25th ACM Symposium on Theory of Computing (STOC), pp. 201–207 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIF, CNRS and Université de Paris, Paris, France

    Carole Delporte-Gallet, Hugues Fauconnier & Pierre Fraigniaud

  2. LIP6, Sorbonne Université, Paris, France

    Mikaël Rabie

Authors
  1. Carole Delporte-Gallet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hugues Fauconnier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pierre Fraigniaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mikaël Rabie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pierre Fraigniaud .

Editor information

Editors and Affiliations

  1. ETH Zurich, Zurich, Switzerland

    Mohsen Ghaffari

  2. Kent State University, Kent, OH, USA

    Mikhail Nesterenko

  3. Sorbonne University, Paris, France

    Sébastien Tixeuil

  4. CEA LIST, Gif-sur-Yvette, France

    Sara Tucci

  5. Kyushu University, Fukuoka, Japan

    Yukiko Yamauchi

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Delporte-Gallet, C., Fauconnier, H., Fraigniaud, P., Rabie, M. (2019). Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model. In: Ghaffari, M., Nesterenko, M., Tixeuil, S., Tucci, S., Yamauchi, Y. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2019. Lecture Notes in Computer Science(), vol 11914. Springer, Cham. https://doi.org/10.1007/978-3-030-34992-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34992-9_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34991-2

  • Online ISBN: 978-3-030-34992-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation