Locality-preserving randomized oblivious routing on torus networks

Arjun Singh, William J. Dally, Brian Towles, Amit K. Gupta
2002 Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '02  
We introduce Randomized Local Balance (RLB), a routing algorithm that strikes a balance between locality and load balance in torus networks, and analyze RLB's performance for benign and adversarial traffic permutations. Our results show that RLB outperforms deterministic algorithms (25% more bandwidth than Dimension Order Routing) and minimal oblivious algorithms (50% more bandwidth than 2 phase ROMM [9]) on worst-case traffic. At the same time, RLB offers higher throughput on local traffic
more » ... a fully randomized algorithm (4.6 times more bandwidth than VAL (Valiant's algorithm) [15] in the best case). RLBth (RLB threshold) improves the locality of RLB to match the throughput of minimal algorithms on very local traffic in exchange for a 4% reduction in worst-case throughput compared to RLB. Both RLB and RLBth give better throughput than all other algorithms we tested on randomly selected traffic permutations. While RLB algorithms have somewhat lower guaranteed bandwidth than VAL they have much lower latency at low offered loads (upto 3.65 times less for RLBth).
doi:10.1145/564870.564873 dblp:conf/spaa/SinghDTG02 fatcat:a4g3h7lpvfbhnn572ctt3chuii