Deadlock-Free Routing is a routing strategy within interconnection networks that belongs to the class of routing algorithms and is distinguished by its guarantee of preventing cyclic channel dependencies, thereby ensuring that packets can always make progress toward their destination without encountering deadlock.
330
Publications
19.6K
Citations
569
Authors
236
Institutions
Publications per year
2017–2026
20
Publications
330
A survey of wormhole routing techniques in direct networks
Lionel M. Ni, Philip K. McKinley · Computer · 1993 · 1.4K citations
1–5 of 330
Authors
569
- JD
22
h-index
- TM
14
h-index
- RH
10
h-index
- LG
10
h-index
- MP
10
h-index
1–5 of 569
Institutions
236
Universitat Politècnica de València
Valencia, Spain
22 h-index
51 publications
3.3K citations
University of Southern California
Los Angeles, United States
14 h-index
30 publications
1.4K citations
University of Illinois Urbana-Champaign
Urbana, United States
13 h-index
26 publications
2K citations
Tsinghua University
Beijing, China
10 h-index
24 publications
791 citations
University of Catania
Catania, Italy
10 h-index
23 publications
1.9K citations
Michigan State University
East Lansing, United States
10 h-index
22 publications
4.4K citations
Florida Atlantic University
Boca Raton, United States
9 h-index
9 publications
367 citations
University of Wisconsin–Madison
Madison, United States
9 h-index
9 publications
653 citations
1–8 of 236
Venues
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 42 publications · 4K citations
29
h-index
- IEEE Transactions on Computers
26 publications · 4.4K citations
21
h-index
- ACM SIGARCH Computer Architecture News
9 publications · 240 citations
9
h-index
- Journal of Parallel and Distributed Computing
6 publications · 205 citations
6
h-index
- Computers & Industrial Engineering
4 publications · 481 citations
4
h-index
1–5