An Interconnection Network Exploiting Trade-Off between Routing Table Size and Path Length

Abstract

Various parallel applications require a low-latency interconnection network to achieve high performance and high scalability. Recently proposed random network topologies achieve low latency, but they require each switch to have a large number of routing table entries, e.g., larger than N for an N-node network, for implementing a minimal routing. In this study, we propose the use of a random network topology with our new routing scheme so that the required routing table size becomes small, e.g., 528 for 8192 nodes, at each switch. Our main finding is that our routing algorithm cannot always follow the minimal paths, but its average path length is still short when compared to that of existing network topologies.