Hypercube Network Routing
Hypercube Network Routing is a routing methodology in parallel computing that directs data packets through the interconnection links of a hypercube network topology by leveraging the binary address-based shortest path determination between nodes to enable efficient, scalable communication among processors.
247
Publications
12.2K
Citations
388
Authors
197
Institutions
Publications per year
2017–2026
6
Parents
247
A Scheme for Fast Parallel Communication
Leslie G. Valiant · SIAM Journal on Computing · 1982 · 649 citations
A variation on the hypercube with lower diameter
Kemal Efe · IEEE Transactions on Computers · 1991 · 306 citations
H.P. Katseff · IEEE Transactions on Computers · 1988 · 269 citations
1–5 of 247
388
8
h-index
7
h-index
5
h-index
5
h-index
Hong Kong University of Science and Technology, Hong Kong SAR China
5 publications · 444 citations
5
h-index
1–5 of 388
197
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
16 publications
959 citations
University of Michigan
Ann Arbor, United States
8 h-index
13 publications
925 citations
Michigan State University
East Lansing, United States
7 h-index
18 publications
1.6K citations
University of Illinois Urbana-Champaign
Urbana, United States
6 h-index
9 publications
445 citations

University of Glasgow
Glasgow, United Kingdom
6 h-index
15 publications
566 citations
IBM (United States)
Armonk, United States
6 h-index
8 publications
392 citations
IBM Research - Almaden
San Jose, United States
6 h-index
8 publications
253 citations

University of Minnesota
Minneapolis, United States
6 h-index
10 publications
230 citations
1–8 of 197
TPDS · 25 publications · 2K citations
21
h-index
22 publications · 944 citations
15
h-index
16 publications · 1.9K citations
14
h-index
11 publications · 238 citations
11
h-index
10 publications · 297 citations
10
h-index
1–5