Cut-through Routing
Cut-Through Routing is a deadlock avoidance method in interconnection networks that belongs to the class of routing strategies, distinguished by enabling a packet to traverse multiple routing stages without acquiring all required channel resources in advance, thereby reducing latency while ensuring deadlock freedom through constrained channel allocation.
59
Publications
2.4K
Citations
132
Authors
60
Institutions
Publications per year
2017–2026
2
Parents
59
Blue Gene/L torus interconnection network
N. R. Adiga, Matthias A. Blumrich, D. Chen et al. · IBM Journal of Research and Development · 2005 · 327 citations
Layered routing in irregular networks
Olav Lysne, Tor Skeie, Sven-Arne Reinemo et al. · IEEE Transactions on Parallel and Distributed Systems · 2006 · 122 citations
1–5 of 59
132
7
h-index
6
h-index
6
h-index
5
h-index
3
h-index
1–5 of 132
60
Universitat Politècnica de València
Valencia, Spain
7 h-index
14 publications
519 citations
University of Michigan
Ann Arbor, United States
7 h-index
10 publications
263 citations
University of Southern California
Los Angeles, United States
6 h-index
9 publications
354 citations

Universidad de Cantabria
Santander, Spain
6 h-index
15 publications
512 citations
Pohang University of Science and Technology
Pohang, South Korea
3 h-index
4 publications
150 citations
Michigan State University
East Lansing, United States
2 h-index
3 publications
197 citations
Queen's University
Kingston, Canada
2 h-index
3 publications
36 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
2 h-index
12 publications
3.6K citations
1–8 of 60
TPDS · 12 publications · 556 citations
12
h-index
6 publications · 280 citations
6
h-index
2 publications · 94 citations
2
h-index
2 publications · 52 citations
2
h-index
Conference · 1 publications · 13 citations
1
h-index
1–5