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

Authors

77

  1. PK
    Philip K. McKinley

    Michigan State University, United States

    5 publications · 177 citations

    5

    h-index

  2. WJ
    William J. Dally

    Stanford University, United States

    3 publications · 96 citations

    3

    h-index

  3. CH
    Ching‐Tien Ho

    IBM Research - Almaden, United States

    3 publications · 103 citations

    3

    h-index

  4. BT
    Brian Towles

    Stanford University, United States

    2 publications · 51 citations

    2

    h-index

  5. HM
    Hiroki Matsutani

    Keio University, Japan

    2 publications · 28 citations

    2

    h-index

1–5 of 77

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 8 publications · 368 citations

    8

    h-index

  2. IEEE Transactions on Computers

    4 publications · 341 citations

    4

    h-index

  3. Perspectives in Science

    1 publications · 20 citations

    1

    h-index

  4. IEEE Photonics Technology Letters

    IPTEL · 1 publications · 74 citations

    1

    h-index

  5. ACM Transactions on Architecture and Code Optimization

    TACO · 1 publications · 42 citations

    1

    h-index

1–5