Asynchronous Parallel Algorithms

Asynchronous Parallel Algorithms is a class of parallel algorithms in which multiple processes execute concurrently without requiring global synchronization at each step, distinguished by their reliance on local coordination and asynchronous communication to achieve fault tolerance and scalability in distributed computing environments.

274

Publications

34.7K

Citations

649

Authors

245

Institutions

Publications per year

2017–2026

70

Authors

649

  1. RC
    Raphaël Couturier

    Franche-Comté Électronique Mécanique Thermique et Optique - Sciences et Technologies, France

    8 publications · 210 citations

    8

    h-index

  2. JM
    Jacques M. Bahi

    Université de Franche-Comté, France

    8 publications · 211 citations

    8

    h-index

  3. XL
    Xiangru Lian

    University of Rochester, United States

    8 publications · 782 citations

    8

    h-index

  4. TG
    Tamara G. Kolda

    Sandia National Laboratories California, United States

    6 publications · 489 citations

    6

    h-index

  5. PS
    P. Spitéri

    Institut National Polytechnique de Toulouse, France

    6 publications · 132 citations

    6

    h-index

1–5 of 649

Venues

  1. arXiv (Cornell University)

    Repository · 30 publications · 1.9K citations

    19

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 8 publications · 323 citations

    8

    h-index

  3. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 5 publications · 211 citations

    5

    h-index

  4. Parallel Computing

    5 publications · 110 citations

    5

    h-index

  5. IEEE Transactions on Computers

    4 publications · 109 citations

    4

    h-index

1–5