• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

DMCA

Token flow control

Cached

  • Download as a PDF

Download Links

  • [www.princeton.edu]
  • [www.ee.princeton.edu]
  • [www.princeton.edu]
  • [cva.stanford.edu]
  • [cs472.pbworks.com]
  • [web.engr.oregonstate.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Amit Kumar, et al.
Citations:635 - 35 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Kumar_tokenflow,
    author = {Amit Kumar and et al.},
    title = {Token flow control},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

As companies move towards many-core chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, state-of-the-art on-chip networks use a modular packet-switched design with routers at every hop which allow sharing of network channels over multiple packet flows. This, however, leads to packets going through a complex router pipeline at every hop, resulting in the overall communication energy/delay being dominated by the router overhead, as opposed to just wire energy/delay. In this work, we propose token flow control (TFC), a flow control mechanism in which nodes in the network send out tokens in their local neighborhood to communicate information about their available resources. These tokens are then used in both routing and flow control: to choose less congested paths in the network and to bypass the router pipeline along those paths. These bypass paths are formed dynamically, can be arbitrarily long and, are highly flexible with the ability to match to a packet’s exact route. Hence, this allows packets to potentially skip all routers along their path from source to destination, approaching the communication energy-delaythroughput of dedicated wires. Our detailed implementation analysis shows TFC to be highly scalable and realizable at an aggressive target clock cycle delay of 21FO4 for large networks while requiring low hardware complexity. Evaluations of TFC using both synthetic traffic and traces from the SPLASH-2 benchmark suite show reduction in packet latency by up to 77.1 % with upto 39.6 % reduction in average router energy consumption as compared to a state-of-theart baseline packet-switched design. For the same saturation throughput as the baseline network, TFC is able to reduce the amount of buffering by 65 % leading to a 48.8 % reduction in leakage energy and a 55.4 % lower total router energy.

Keyphrases

token flow control    large network    network channel    splash-2 benchmark suite show reduction    communication energy-delaythroughput    flow control mechanism    complex router pipeline    aggressive target clock cycle delay    flow control    detailed implementation analysis    low hardware complexity    overall communication energy delay    baseline network    efficient onchip communication fabric    dedicated wire    congested path    saturation throughput    router pipeline    synthetic traffic    state-of-the-art on-chip network    packet exact route    modular packet-switched design    energy delay    bypass path    average router energy consumption    total router energy    local neighborhood    state-of-theart baseline packet-switched design    leakage energy    available resource    bandwidth demand    packet latency    multiple packet    router overhead    critical importance    delay scalability   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University