Deadlock Avoidance

Deadlock Avoidance is a dynamic control strategy in interconnection networks and message passing systems that belongs to the class of deadlock management techniques, distinguished by its requirement of granting resource allocations only when the resulting global system state remains provably free of cycles in the channel dependency graph.

1.3K

Publications

65.5K

Citations

2K

Authors

686

Institutions

Publications per year

2017–2026

150

Authors

2K

  1. MZ
    MengChu Zhou

    New Jersey Institute of Technology, United States

    82 publications · 6.2K citations

    42

    h-index

  2. JD
    J. Duato

    Universitat Politècnica de València, Spain

    39 publications · 2.9K citations

    31

    h-index

  3. ZL
    Zhiwu Li

    Xidian University, China

    53 publications · 3.7K citations

    31

    h-index

  4. NW
    Naiqi Wu

    Macau University of Science and Technology, Macao SAR China

    27 publications · 2K citations

    22

    h-index

  5. SR
    Spyros Reveliotis

    Georgia Institute of Technology, United States

    29 publications · 1.6K citations

    19

    h-index

1–5 of 2K

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 56 publications · 4.8K citations

    33

    h-index

  2. IEEE Transactions on Computers

    39 publications · 7.6K citations

    29

    h-index

  3. 27

    h-index

  4. IEEE Transactions on Software Engineering

    TSE · 32 publications · 1.4K citations

    21

    h-index

  5. IEEE Transactions on Robotics and Automation

    20 publications · 4.8K citations

    20

    h-index

1–5