Odd-even Routing

Odd-Even Routing is a deterministic adaptive routing algorithm for mesh networks that belongs to the class of deadlock-free routing methods, distinguished by its restriction of packet movement based on the parity (odd or even) of the current node’s coordinates to prevent cyclic channel dependencies.

17

Publications

1.3K

Citations

41

Authors

19

Institutions

Publications per year

2017–2026

1

Authors

41

  1. MP
    Maurizio Palesi

    University of Catania, Italy

    5 publications · 415 citations

    5

    h-index

  2. VC
    Vincenzo Catania

    University of Catania, Italy

    3 publications · 372 citations

    3

    h-index

  3. CL
    Caro Lucas

    University of Tehran, Iran

    2 publications · 92 citations

    2

    h-index

  4. WZ
    Wang Zhang

    Beijing University of Technology, China

    2 publications · 110 citations

    2

    h-index

  5. AY
    Alex Yakovlev

    Newcastle University, United Kingdom

    2 publications · 46 citations

    2

    h-index

1–5 of 41

Venues

  1. IEEE Transactions on Computers

    2 publications · 267 citations

    2

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 1 publications · 26 citations

    1

    h-index

  3. 2008 Design, Automation and Test in Europe

    Conference · 1 publications · 45 citations

    1

    h-index

  4. 1

    h-index

  5. 1

    h-index

1–5