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

Authors

388

  1. HS
    Hamid Sarbazi‐Azad

    Sharif University of Technology, Iran

    8 publications · 247 citations

    8

    h-index

  2. MO
    M. Ould‐Khaoua

    University of Glasgow, United Kingdom

    7 publications · 345 citations

    7

    h-index

  3. KK
    Keiichi Kaneko

    Tokyo University of Agriculture and Technology, Japan

    5 publications · 79 citations

    5

    h-index

  4. PK
    Philip K. McKinley

    Michigan State University, United States

    5 publications · 509 citations

    5

    h-index

  5. LM
    Lionel M. Ni

    Hong Kong University of Science and Technology, Hong Kong SAR China

    5 publications · 444 citations

    5

    h-index

1–5 of 388

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 25 publications · 2K citations

    21

    h-index

  2. Journal of Parallel and Distributed Computing

    22 publications · 944 citations

    15

    h-index

  3. IEEE Transactions on Computers

    16 publications · 1.9K citations

    14

    h-index

  4. Information Processing Letters

    11 publications · 238 citations

    11

    h-index

  5. Parallel Computing

    10 publications · 297 citations

    10

    h-index

1–5