The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - July-December (2011 vol.10)
pp: 33-36
George Michelogiannakis , Stanford University Stanford University, Stanford Stanford
Nan Jiang , Stanford University, Stanford
Daniel Becker , Stanford University, Stanford
William Dally , Stanford University, Stanford
ABSTRACT
This paper introduces packet chaining, a simple and effective method to increase allocator matching efficiency and hence network performance, particularly suited to networks with short packets and short cycle times. Packet chaining operates by chaining packets destined to the same output together, to reuse the switch connection of a departing packet. This allows an allocator to build up an efficient matching over a number of cycles, like incremental allocation, but not limited by packet length. For a 64-node 2D mesh at maximum injection rate and with single-flit packets, packet chaining increases network throughput by 15% compared to a conventional single-iteration separable iSLIP allocator, outperforms a wavefront allocator, and gives comparable throughput with an augmenting paths allocator. Packet chaining achieves this performance with a cycle time comparable to a single-iteration separable allocator. Packet chaining also reduces average network latency by 22.5%. Finally, packet chaining increases IPC up to 46% (16% average) for application benchmarks because short packets are critical in a typical cache-coherent CMP. These are considerable improvements given the maturity of network-on-chip routers and allocators.
INDEX TERMS
On-chip interconnection networks, Interconnection architectures
CITATION
George Michelogiannakis, Nan Jiang, Daniel Becker, William Dally, "Packet Chaining: Efficient Single-Cycle Allocation for On-Chip Networks", IEEE Computer Architecture Letters, vol.10, no. 2, pp. 33-36, July-December 2011, doi:10.1109/L-CA.2011.15
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool