Locality-preserving randomized oblivious routing on torus networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A comparative study of arbitration algorithms for the Alpha 21364 pipelined router
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Proceedings of the 32nd annual international symposium on Computer Architecture
NoC-Based FPGA: Architecture and Routing
NOCS '07 Proceedings of the First International Symposium on Networks-on-Chip
Optimal capacity allocation for load balanced shortest path routing
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Low-overhead error detection for networks-on-chip
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
Two phase load balanced routing using OSPF
IEEE Journal on Selected Areas in Communications
Fine two-phase routing over shortest paths with traffic matrix
Computer Networks: The International Journal of Computer and Telecommunications Networking
High and stable performance under adverse traffic patterns of tori-connected torus network
Computers and Electrical Engineering
| Hi-index | 0.00 |
This paper presents an algorithm to find a worst-case trafficpattern for any oblivious routing algorithm on an arbitrary interconnectionnetwork topology. The linearity of channel loading offered by obliviousrouting algorithms enables the problem to be mapped to a bipartitemaximum-weight matching, which can be solved in polynomial time forrouting functions with a polynomial number of paths. Finding exact worstcaseperformance was previously intractable, and we demonstrate an examplecase where traditional characterization techniques overestimate thethroughput of a particular routing algorithm by 47%.