1 / 14

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, Xiaola Lin, Liang Tang Publish Journal of parallel and Distributed Computing. outline. Some background Virtual channel wormhole switching MAS Microarchitecture Evaluation Simulation results.

elsu
Download Presentation

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

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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

  2. outline • Some background • Virtual channel • wormhole switching • MAS • Microarchitecture • Evaluation • Simulation results

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

  4. 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.

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

  6. Make a stop • 藉由增設一動態register 來給 flitsstop 以取代 buffers 並 減少 deflected

  7. Arbitration unit • register array • switchcrossbar

  8. Router hasfive input ports and five output ports • Warm-up period of 100,000 cycles • 10,000 packets are injected per node

  9. 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.

  10. 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.

  11. the average hop count per packet as a function of injected rate under different synthetic traffic patterns before network saturates.

  12. The power by flits traversing through the channels + the power needed by the switches in the router.

More Related