2016-1-29Advanced Processor Group The School of Computer Science A Dynamic Link Allocation Router Wei Song, Doug Edwards Advanced Processor Group The University.

Slides:

Advertisements

Similar presentations

Bulk-Data Metanet: Virtualization by Example Sergey Gorinsky Applied Research Laboratory Applied Research Laboratory Department of Computer Science and.

Advertisements

Nick Feamster CS 4251 Computer Networking II Spring 2008

Interconnection Networks: Flow Control and Microarchitecture.

Prof. Natalie Enright Jerger

QuT: A Low-Power Optical Network-on-chip

A Novel 3D Layer-Multiplexed On-Chip Network

Fault-Tolerant Network-Interface for Spatial Division Multiplexing Based Network-on-Chip By Anup Das.

1 Agenda TMA2 Feedback TMA3 T821 Bock 2. 2 Packet Switching.

Flattened Butterfly Topology for On-Chip Networks John Kim, James Balfour, and William J. Dally Presented by Jun Pang.

Evaluating Bufferless Flow Control for On-Chip Networks George Michelogiannakis, Daniel Sanchez, William J. Dally, Christos Kozyrakis Stanford University.

1 Message passing architectures and routing CEG 4131 Computer Architecture III Miodrag Bolic Material for these slides is taken from the book: W. Dally,

What is Flow Control ? Flow Control determines how a network resources, such as channel bandwidth, buffer capacity and control state are allocated to packet.

Reporter: Bo-Yi Shiu Date: 2011/05/27 Virtual Point-to-Point Connections for NoCs Mehdi Modarressi, Arash Tavakkol, and Hamid Sarbazi- Azad IEEE TRANSACTIONS.

Allocator Implementations for Network-on-Chip Routers Daniel U. Becker and William J. Dally Concurrent VLSI Architecture Group Stanford University.

Module R R RRR R RRRRR RR R R R R Efficient Link Capacity and QoS Design for Wormhole Network-on-Chip Zvika Guz, Isask ’ har Walter, Evgeny Bolotin, Israel.

High Performance Router Architectures for Network- based Computing By Dr. Timothy Mark Pinkston University of South California Computer Engineering Division.

Packet-Switched vs. Time-Multiplexed FPGA Overlay Networks Kapre et. al RC Reading Group – 3/29/2006 Presenter: Ilya Tabakh.

1 Lecture 23: Interconnection Networks Paper: Express Virtual Channels: Towards the Ideal Interconnection Fabric, ISCA’07, Princeton.

Lei Wang, Yuho Jin, Hyungjun Kim and Eun Jung Kim

1 Link Division Multiplexing (LDM) for NoC Links IEEE 2006 LDM Link Division Multiplexing Arkadiy Morgenshtein, Avinoam Kolodny, Ran Ginosar Technion –

Network-on-Chip Examples System-on-Chip Group, CSE-IMM, DTU.

Network-on-Chip Links and Implementation Issues System-on-Chip Group, CSE-IMM, DTU.

1 Indirect Adaptive Routing on Large Scale Interconnection Networks Nan Jiang, William J. Dally Computer System Laboratory Stanford University John Kim.

8.1 Chapter 8 Switching Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Performance and Power Efficient On-Chip Communication Using Adaptive Virtual Point-to-Point Connections M. Modarressi, H. Sarbazi-Azad, and A. Tavakkol.

Chapter 1: Overview Lecturer: Alias Mohd Telecommunications Department Faculty of Electrical Engineering UTM SET 4573: Data Communication and Switching.

High Performance Embedded Computing © 2007 Elsevier Lecture 16: Interconnection Networks Embedded Computing Systems Mikko Lipasti, adapted from M. Schulte.

1 The Turn Model for Adaptive Routing. 2 Summary Introduction to Direct Networks. Deadlocks in Wormhole Routing. System Model. Partially Adaptive Routing.

On-Chip Networks and Testing

Report Advisor: Dr. Vishwani D. Agrawal Report Committee: Dr. Shiwen Mao and Dr. Jitendra Tugnait Survey of Wireless Network-on-Chip Systems Master’s Project.

QoS Support in High-Speed, Wormhole Routing Networks Mario Gerla, B. Kannan, Bruce Kwan, Prasasth Palanti,Simon Walton.

1 Yue Qiao Computer Science and Engineering Sep AirExpress: Enabling Seamless In-band.

Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.

Deadlock CEG 4131 Computer Architecture III Miodrag Bolic.

Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.

1 Message passing architectures and routing CEG 4131 Computer Architecture III Miodrag Bolic Material for these slides is taken from the book: W. Dally,

CS 8501 Networks-on-Chip (NoCs) Lukasz Szafaryn 15 FEB 10.

Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki Frame Relay Congestion.

4: DataLink Layer1 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single wire, e.g. PPP, SLIP) r broadcast (shared wire.

Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.

Yu Cai Ken Mai Onur Mutlu

Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.

Interconnect Networks Basics. Generic parallel/distributed system architecture On-chip interconnects (manycore processor) Off-chip interconnects (clusters.

Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.

Virtual-Channel Flow Control William J. Dally

Building A Network: Cost Effective Resource Sharing

Flow Control Ben Abdallah Abderazek The University of Aizu

1 Lecture 29: Interconnection Networks Papers: Express Virtual Channels: Towards the Ideal Interconnection Fabric, ISCA’07, Princeton Interconnect Design.

On-time Network On-Chip: Analysis and Architecture CS252 Project Presentation Dai Bui.

Network-on-Chip Paradigm Erman Doğan. OUTLINE SoC Communication Basics  Bus Architecture  Pros, Cons and Alternatives NoC  Why NoC?  Components 

Chapter 3 Part 3 Switching and Bridging

Architecture and Algorithms for an IEEE 802

Point-to-Point Network Switching

The network-on-chip protocol

Dynamic connection system

Exploring Concentration and Channel Slicing in On-chip Network Router

Chapter 3 Switching.

SWITCHING Switched Network Circuit-Switched Network Datagram Networks

On-Time Network On-chip

Chapter 3 Part 3 Switching and Bridging

Wireless ATM PRESENTED BY : NIPURBA KONAR.

Raymond'S Tree DMX Algorithm

On-time Network On-chip

CEG 4131 Computer Architecture III Miodrag Bolic

COMP60621 Fundamentals of Parallel and Distributed Systems

Network-on-Chip Programmable Platform in Versal™ ACAP Architecture

Chapter 3 Part 3 Switching and Bridging

Circuit Switched Network

COMP60611 Fundamentals of Parallel and Distributed Systems

Multiprocessors and Multi-computers

Presentation transcript:

Advanced Processor Group The School of Computer Science A Dynamic Link Allocation Router Wei Song, Doug Edwards Advanced Processor Group The University of Manchester

Advanced Processor Group The School of Computer Science Overview Network-on-a-Reconfigurable-ChipNetwork-on-a-Reconfigurable-Chip The Dynamic Link Allocation Flow control method The Dynamic Link Allocation Router (DyLAR) Conclusion

Advanced Processor Group The School of Computer Science The NoRC Platform NoRC: network on a reconfigurable chip Running multimedia applications Connection oriented Stochastic routing algorithm GALS: fully asynchronous routers linked by CHAIN

Advanced Processor Group The School of Computer Science Connection Oriented Routing Flit Definitions Request Flit Other Flits

Advanced Processor Group The School of Computer Science The High Retry Rate Simulation results of a 6x6 NoC with 12 functions in network. 7% Virtual Channels are required to reduce the retry rate.

Advanced Processor Group The School of Computer Science Overview Network-on-a-Reconfigurable-Chip The Dynamic Link Allocation Flow control methodThe Dynamic Link Allocation Flow control method The Dynamic Link Allocation Router (DyLAR) Conclusion

Advanced Processor Group The School of Computer Science Major Design Targets Implement some kind of virtual channels Increase the bandwidth of CHAIN links Reduce the area and power of the router

Advanced Processor Group The School of Computer Science Increase the bandwidth Asynchronous Links work better with the lower wire count.

Advanced Processor Group The School of Computer Science Increase the bandwidth

Advanced Processor Group The School of Computer Science Increase the bandwidth Spatial division multiplex (SDM) is a good choice for asynchronous NoCs.

Advanced Processor Group The School of Computer Science Problems of SDM SDM has the low bandwidth efficiency. Spare sub-link

Advanced Processor Group The School of Computer Science Problems of SDM

Advanced Processor Group The School of Computer Science Dynamic Link Allocation Divide the sub-link allocation apart from the path reservation Allocate idle sub-link to active communications that reserved this link All communications fairly compete for the bandwidth

Advanced Processor Group The School of Computer Science Overview Network-on-a-Reconfigurable-Chip The Dynamic Link Allocation Flow control method The Dynamic Link Allocation Router (DyLAR)The Dynamic Link Allocation Router (DyLAR) Conclusion

Advanced Processor Group The School of Computer Science Dynamic Link Allocation Router (DyLAR)

Advanced Processor Group The School of Computer Science Path Reservation Stage

Advanced Processor Group The School of Computer Science Data Transmission Stage

Advanced Processor Group The School of Computer Science Head-of-line (HOL) Problem

Advanced Processor Group The School of Computer Science Backpressure

Advanced Processor Group The School of Computer Science Backpressure

Advanced Processor Group The School of Computer Science Overview Network-on-a-Reconfigurable-Chip The Dynamic Link Allocation Flow control method The Dynamic Link Allocation Router (DyLAR) ConclusionConclusion

Advanced Processor Group The School of Computer Science Conclusion Contribution –A new flow control method –Implement the first asynchronous spatial division router Advantages –Smaller latency under zero load –Larger overall throughput under heavy load –Smaller retry rate (smaller power consumption) Problems –An extra request switch in each router –Extra control logic –Increase the latency to pass a router

Advanced Processor Group The School of Computer Science Thank You! Questions?

Advanced Processor Group The School of Computer Science Detailed Procedures –Request –Path reserved –Sending data –Release path

Advanced Processor Group The School of Computer Science Request Procedure

Advanced Processor Group The School of Computer Science Request Procedure

Advanced Processor Group The School of Computer Science Request Procedure

Advanced Processor Group The School of Computer Science Request Procedure

Advanced Processor Group The School of Computer Science Request Procedure

Advanced Processor Group The School of Computer Science Request Procedure

Advanced Processor Group The School of Computer Science OK Ack

Advanced Processor Group The School of Computer Science OK Ack

Advanced Processor Group The School of Computer Science OK Ack

Advanced Processor Group The School of Computer Science OK Ack

Advanced Processor Group The School of Computer Science OK Ack

Advanced Processor Group The School of Computer Science OK Ack

Advanced Processor Group The School of Computer Science Data Flits

Advanced Processor Group The School of Computer Science Data Flits

Advanced Processor Group The School of Computer Science Data Flits

Advanced Processor Group The School of Computer Science Data Flits

Advanced Processor Group The School of Computer Science Data Flits

Advanced Processor Group The School of Computer Science Data Flits

Advanced Processor Group The School of Computer Science Data Flits

Advanced Processor Group The School of Computer Science False Ack

Advanced Processor Group The School of Computer Science False Ack

Advanced Processor Group The School of Computer Science False Ack

Advanced Processor Group The School of Computer Science False Ack

Advanced Processor Group The School of Computer Science False Ack