Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Delay Model for Router Microarchitectures
IEEE Micro
An overview of the BlueGene/L Supercomputer
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
The BlackWidow High-Radix Clos Network
Proceedings of the 33rd annual international symposium on Computer Architecture
Communication latency aware low power NoC synthesis
Proceedings of the 43rd annual Design Automation Conference
Overview of the Blue Gene/L system architecture
IBM Journal of Research and Development
Packaging the Blue Gene/L supercomputer
IBM Journal of Research and Development
Optimizing task layout on the Blue Gene/L supercomputer
IBM Journal of Research and Development
Hi-index | 0.00 |
In today's many-core era, the interconnection networks have been the key factor that dominates the performance of a computer system. In this paper, we propose a design flow to discover the best topology in terms of the communication latency and physical constraints. First a set of representative candidate topologies are generated for the interconnection networks among computing chips; then an efficient multi-commodity flow algorithm is devised to evaluate the performance. The experiments show that the best topologies identified by our algorithm can achieve better average latency compared to the existing networks.