Mesh Deadlock Avoidance
Mesh Deadlock Avoidance is a deadlock avoidance strategy that belongs to the class of topological deadlock prevention methods, specifically distinguished by its use of constrained routing paths in mesh-interconnected parallel computing systems to ensure that cyclic wait conditions cannot arise among competing resource requests.
24
Publications
737
Citations
48
Authors
24
Institutions
Publications per year
2017–2026
1
Parents
24
1–5 of 24
48
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 48
24
Florida Atlantic University
Boca Raton, United States
6 h-index
6 publications
100 citations
Tsinghua University
Beijing, China
3 h-index
5 publications
202 citations

National Taiwan University
Taipei, Taiwan
2 h-index
3 publications
211 citations

Montclair State University
Montclair, United States
2 h-index
2 publications
31 citations

West Chester University
West Chester, United States
2 h-index
2 publications
41 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
4 publications
63 citations
National Tsing Hua University
Hsinchu, Taiwan
1 h-index
1 publications
11 citations
University of Catania
Catania, Italy
1 h-index
1 publications
43 citations
1–8 of 24
JSA · 2 publications · 57 citations
2
h-index
2 publications · 135 citations
2
h-index
1 publications · 36 citations
1
h-index
1 publications · 28 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5