Making a stop a new bufferless routing algorithm for on chip network
Download
1 / 14

Making-a-stop: A new bufferless routing algorithm for on-chip network - PowerPoint PPT Presentation


  • 106 Views
  • Uploaded on

Making-a-stop: A new bufferless routing algorithm for on-chip network. Author : Jing Lin, Xiaola Lin, Liang Tang Publish Journal of parallel and Distributed Computing. outline. Some background Virtual channel wormhole switching MAS Microarchitecture Evaluation Simulation results.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Making-a-stop: A new bufferless routing algorithm for on-chip network' - elsu


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Making a stop a new bufferless routing algorithm for on chip network

Making-a-stop: A new bufferless routing algorithm for on-chip network

Author : Jing Lin, XiaolaLin, Liang Tang

Publish Journal of parallel and Distributed Computing


Outline
outline

  • Some background

    • Virtual channel

    • wormhole switching

  • MAS

  • Microarchitecture

  • Evaluation

  • Simulation results


Virtual channel
Virtual channel

  • A channel designation which differs from that of the actual radio channel (or range of frequencies) on which the signal travels


Wormhole switching
wormhole switching

  • Large network packets are broken into small pieces called flits (flow control digits). The first flit, called the header flit holds information about this packet's route (namely the destination address) and sets up the routing behavior for all subsequent flits associated with the packet. The head flit is followed by zero or more body flits, containing the actual pay load of data. The final flit, called the tail flit, performs some book keeping to close the connection between the two nodes. One thing special about wormhole flow control is the implementation of virtual channels.


Problem
problem

  • buffer routing need more power and area and also adds the complexity of on-chip network design.


Make a stop
Make a stop

  • 藉由增設一動態register

    來給 flitsstop 以取代

    buffers 並 減少 deflected



  • Router hasfive input ports and five output ports

  • Warm-up period of 100,000 cycles

  • 10,000 packets are injected per node


Traffic patterns
traffic patterns

  • OR traffic assumes each node uniformly injects packets to randomly distributed destinations in the network.

  • In TR traffic, the node ( i , j ) only communicates with node ( j , i ) .

  • In HS traffic, four hotspot nodes are located at the center of the network. The 80% of traffic is sent to randomly distributed destinations in the network, while the remaining traffic is to the hotspot nodes.


Latency
latency

  • Packet latency is

    calculated from the time

    when the first flit of

    a packet is generated,

    to the time when its last

    flit is ejected at the

    destination, including

    source queueing time.


  • the average hop

    count per packet as

    a function of injected

    rate under different

    synthetic traffic

    patterns before

    network saturates.


  • The power by flits

    traversing through the

    channels + the power

    needed by the switches in the router.


ad