FatPaths: routing in supercomputers and data centers when shortest paths fall short.
Maciej BestaMarcel SchneiderMarek KoniecznyKarolina CynkErik HenrikssonSalvatore Di GirolamoAnkit SinglaTorsten HoeflerPublished in: SC (2020)
Keyphrases
- shortest path
- data center
- routing algorithm
- cloud computing
- energy efficiency
- energy aware
- high performance computing
- shortest path problem
- routing problem
- shortest path algorithm
- road network
- cost effective
- virtual machine
- traffic engineering
- dijkstra algorithm
- massively parallel
- power consumption
- energy consumption
- path length
- flow graph
- parallel computing
- optimal path
- carbon dioxide
- network routing
- strongly connected components
- database
- multi tenant
- computing resources
- travel time
- weighted graph
- routing protocol
- geodesic distance
- metric space
- random walk
- data management