Module caminos_lib::routing::polarized

source ·
Expand description

The Polarized routing. A routing that includes many routes of many lengths.

In some topologies packets may reach corner vertices for which Polarized routing does not have legal extension. In these topologies Polarized routing should be use in combination with other scheme. For example, even something as naive as a SumRouting with Mindless may work fine.

  • Camarero, C., Martínez, C., & Beivide, R. (2021, August). Polarized routing: an efficient and versatile algorithm for large direct networks. In 2021 IEEE Symposium on High-Performance Interconnects (HOTI) (pp. 52-59). IEEE.
  • Camarero, C., Martínez, C., & Beivide, R. (2022). Polarized routing for large interconnection networks. IEEE Micro, 42(2), 61-67.

Structs

  • Polarized
    The Polarized routing algorithm. Find polarized routes in a greedy way. Tries to minimize the weight D(s,c)-D(c,t) for current c, source s, and target t. Equal steps are only allowed in the current ‘direction’ (away from source or towards target). Polarized routes have maximum length of at most 4*diameter - 3.