Dimension-order Routing
Dimension-Order Routing is a deterministic routing algorithm for torus networks that belongs to the class of routing algorithms in mesh and torus topologies, distinguished by its restriction of message traversal to follow a fixed sequence of dimensions, thereby avoiding deadlock through ordered dimension traversal.
36
Publications
1.3K
Citations
77
Authors
39
Institutions
Publications per year
2017–2026
1
36
Recursive partitioning multicast: A bandwidth-efficient routing for Networks-on-Chip
Lei Wang, Yuho Jin, Hyungjun Kim et al. · 2009 · 90 citations
1–5 of 36
77
5
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 77
39
Michigan State University
East Lansing, United States
5 h-index
13 publications
414 citations
IBM Research - Almaden
San Jose, United States
3 h-index
7 publications
201 citations
National Central University
Taoyuan City, Taiwan
2 h-index
3 publications
72 citations

National Institute of Informatics
Tokyo, Japan
2 h-index
3 publications
44 citations
Stanford University
Stanford, United States
2 h-index
8 publications
204 citations

Keio University
Tokyo, Japan
2 h-index
7 publications
92 citations
The University of Texas at San Antonio
San Antonio, United States
2 h-index
2 publications
104 citations
Tsinghua University
Beijing, China
2 h-index
5 publications
140 citations
1–8 of 39
TPDS · 8 publications · 368 citations
8
h-index
4 publications · 341 citations
4
h-index
1 publications · 20 citations
1
h-index
IPTEL · 1 publications · 74 citations
1
h-index
TACO · 1 publications · 42 citations
1
h-index
1–5