SC2021Top-tier venue
SEEC: stochastic escape express channel
Mayank Parasar, Natalie D. Enright Jerger, Paul V. Gratz, Joshua San Miguel, Tushar Krishna
Abstract
Allocating a free buffer before moving to the next router is a fundamental tenet for packet movement in NoCs. Often, to solve head of line blocking and avoid deadlock, NoCs are provisioned with significant buffer resources in the form of virtual channels (VC) which consume area and power. We introduce stochastic escape express channels (SEEC) to enhance performance and avoid deadlock with dramatically fewer buffers than state-of-the-art NoCs. The network interfaces in SEEC periodically send special tokens called seekers to find packets destined for them and upgrade them to use a novel flow control called Free-Flow (FF). FF-packets traverse the network minimally from link to link, bypassing routers (bufferlessly) to the destination. As a result, FF-packets bypass regions of congestion in the NoC without needing more buffers. Furthermore, any deadlock that a FF-packet was originally involved in is guaranteed to break, without requiring turn restrictions or extra VCs. We also present an extension called multi-SEEC (mSEEC) that enables multiple simultaneous non-intersecting FF-packet traversals to enhance throughput further. We implement and evaluate SEEC and mSEEC on a mesh over a range of synthetic workloads and real applications and observe 34--40% reduction in average packet latency for real applications and 10--50% average improvement in throughput for synthetic traffic over the state-of-the-art at 1/6th the area/power budget.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext f11ba399-5e33-4202-963e-e542484baa38Cited by top-tier papers2
- Stay in your Lane: A NoC with Low-overhead Multi-packet BypassingHossein Farrokhbakht, Paul V. Gratz, Tushar Krishna, Joshua San Miguel et al.HPCA 2022 · 21 citations
- Determining the Minimum Number of Virtual Networks for Different Coherence ProtocolsWeihang Li, Andrés Goens, Nicolai Oswald, Vijay Nagarajan et al.ISCA 2024 · 5 citations
Builds on2
- DRAIN: Deadlock Removal for Arbitrary Irregular NetworksMayank Parasar, Hossein Farrokhbakht, Natalie D. Enright Jerger, Paul V. Gratz et al.HPCA 2020 · 34 citations
- Pitstop: Enabling a Virtual Network Free Network-on-ChipHossein Farrokhbakht, Henry Kao, Kamran Hasan, Paul V. Gratz et al.HPCA 2021 · 29 citations
Related papers
- FastTrackNoC: A NoC with FastTrack Router DatapathsAhsen Ejaz, Ioannis SourdisHPCA 2022 · 4 citations
- VVQ: Virtualizing Virtual Channel for Cost-Efficient Protocol Deadlock AvoidanceHans Kasan, John KimHPCA 2023 · 3 citations
- Topology Agnostic Virtual Channel Assignment and Protocol Level Deadlock Avoidance in a Network-on-ChipAnup Gangwar, Ravishankar Sreedharan, Ambica Prasad, Nitin Kumar Agarwal et al.DAC 2021 · 7 citations
- BoomGate: Deadlock Avoidance in Non-Minimal Routing for High-Radix NetworksGyuyoung Kwauk, Seungkwan Kang, Hans Kasan, Hyojun Son et al.HPCA 2021 · 8 citations
- ZENCO: Zero-bytes based ENCOding for Non-Volatile Buffers in On-Chip InterconnectsKhushboo Rani, Hemangee K. KapoorDAC 2020 · 1 citation
