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
1.3K
A survey of wormhole routing techniques in direct networks
Lionel M. Ni, Philip K. McKinley · Computer · 1993 · 1.4K citations
1–5 of 1.3K
2K
42
h-index
31
h-index
31
h-index
22
h-index
19
h-index
1–5 of 2K
686
New Jersey Institute of Technology
Newark, United States
45 h-index
96 publications
7.2K citations

Xidian University
Xi'an, China
40 h-index
173 publications
9.7K citations
Universitat Politècnica de València
Valencia, Spain
30 h-index
70 publications
4K citations
Georgia Institute of Technology
Atlanta, United States
25 h-index
67 publications
2.6K citations

Xi'an Jiaotong University
Xi'an, China
23 h-index
84 publications
4.8K citations
Tongji University
Shanghai, China
22 h-index
41 publications
1.9K citations
University of Southern California
Los Angeles, United States
20 h-index
41 publications
1.9K citations
Macau University of Science and Technology
Macao, Macao
19 h-index
34 publications
1.4K citations
1–8 of 686
TPDS · 56 publications · 4.8K citations
33
h-index
39 publications · 7.6K citations
29
h-index
32 publications · 4.2K citations
27
h-index
TSE · 32 publications · 1.4K citations
21
h-index
20 publications · 4.8K citations
20
h-index
1–5