Uniform Minimal First: Latency Reduction in Throughput-Optimal Oblivious Routing for Mesh-Based Networks-on-Chip

摘要

Mesh-based networks-on-chips (NoCs) are increasingly used for on-chip communications in embedded multicore processors. O1TURN is a well-known oblivious routing algorithm for mesh-based NoCs that has been shown to be worst-case throughput optimal for even network radices, but not for odd radices. More recently, another oblivious routing algorithm called U2TURN has been shown to be worst-case throughput optimal for both odd and even radices. This is accomplished by load-balancing among 2-turn paths in XYX or YXY routing, including nonminimal paths. Besides being worst-case throughput optimal, U2TURN achieves higher throughput than O1TURN under adversarial traffic. However, for random traffic, where the traffic is inherently load-balanced, O1TURN achieves lower network latency since it only considers minimal paths. In this letter, we propose a hybrid oblivious routing algorithm called uniform-minimal-first (UMF) routing. UMF works by exploiting any inherent load-balancing characteristics of the traffic pattern to reduce packet latency, but it retains the throughput optimality of U2TURN for both odd and even radices, and it achieves the performance of U2TURN under adversarial traffic. UMF is very inexpensive to implement as it just requires incrementing two small counters, but only for the head flit when a node injects a new packet (not for any pass-through traffic). These simple updates can be performed one cycle ahead of packet injection to avoid slowing down any router pipeline stage. Despite its simplicity, UMF outperforms U2TURN by 23.7% under random traffic and O1TURN by 12.6% under adversarial traffic.