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

Authors

132

  1. JD
    J. Duato

    Universitat Politècnica de València, Spain

    7 publications · 319 citations

    7

    h-index

  2. KG
    Kang G. Shin

    University of Michigan, United States

    6 publications · 148 citations

    6

    h-index

  3. TM
    Timothy M. Pinkston

    University of Southern California, United States

    6 publications · 286 citations

    6

    h-index

  4. RB
    R. Beivide

    Universidad de Cantabria, Spain

    5 publications · 171 citations

    5

    h-index

  5. OL
    Olav Lysne

    Simula Research Laboratory, Norway

    3 publications · 194 citations

    3

    h-index

1–5 of 132

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 12 publications · 556 citations

    12

    h-index

  2. IEEE Transactions on Computers

    6 publications · 280 citations

    6

    h-index

  3. IEEE Transactions on Communications

    2 publications · 94 citations

    2

    h-index

  4. Journal of Parallel and Distributed Computing

    2 publications · 52 citations

    2

    h-index

  5. Parallel and Distributed Processing Techniques and Applications

    Conference · 1 publications · 13 citations

    1

    h-index

1–5