NOC Deadlock and Livelock

Similar documents
Deadlock and Livelock. Maurizio Palesi

Lecture: Interconnection Networks. Topics: TM wrap-up, routing, deadlock, flow control, virtual channels

Fault-adaptive routing

Lecture 12: Interconnection Networks. Topics: dimension/arity, routing, deadlock, flow control

Lecture 24: Interconnection Networks. Topics: topologies, routing, deadlocks, flow control

Networks: Routing, Deadlock, Flow Control, Switch Design, Case Studies. Admin

Deadlock-free XY-YX router for on-chip interconnection network

Deadlock. Reading. Ensuring Packet Delivery. Overview: The Problem

EE 382C Interconnection Networks

Lecture 15: PCM, Networks. Today: PCM wrap-up, projects discussion, on-chip networks background

Lecture 16: On-Chip Networks. Topics: Cache networks, NoC basics

Generic Methodologies for Deadlock-Free Routing

Lecture 12: Interconnection Networks. Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E)

Lecture 3: Flow-Control

Routing Algorithm. How do I know where a packet should go? Topology does NOT determine routing (e.g., many paths through torus)

Interconnection topologies (cont.) [ ] In meshes and hypercubes, the average distance increases with the dth root of N.

Flow Control can be viewed as a problem of

TDT Appendix E Interconnection Networks

SoC Design. Prof. Dr. Christophe Bobda Institut für Informatik Lehrstuhl für Technische Informatik

Routing Algorithms. Review

Extended Junction Based Source Routing Technique for Large Mesh Topology Network on Chip Platforms

A Deterministic Fault-Tolerant and Deadlock-Free Routing Protocol in 2-D Meshes Based on Odd-Even Turn Model

The Odd-Even Turn Model for Adaptive Routing

Communication Performance in Network-on-Chips

Lecture 13: Interconnection Networks. Topics: lots of background, recent innovations for power and performance

HiRA: A Methodology for Deadlock Free Routing in Hierarchical Networks on Chip

EECS 578 Interconnect Mini-project

OASIS NoC Architecture Design in Verilog HDL Technical Report: TR OASIS

Deadlock and Router Micro-Architecture

JUNCTION BASED ROUTING: A NOVEL TECHNIQUE FOR LARGE NETWORK ON CHIP PLATFORMS

Dynamic Stress Wormhole Routing for Spidergon NoC with effective fault tolerance and load distribution

EC 513 Computer Architecture

Efficient And Advance Routing Logic For Network On Chip

Lecture 18: Communication Models and Architectures: Interconnection Networks

Demand Based Routing in Network-on-Chip(NoC)

A Dynamic NOC Arbitration Technique using Combination of VCT and XY Routing

Network-on-chip (NOC) Topologies

Interconnection Networks: Routing. Prof. Natalie Enright Jerger

Evaluation of NOC Using Tightly Coupled Router Architecture

EECS 570. Lecture 19 Interconnects: Flow Control. Winter 2018 Subhankar Pal

Comparison of Deadlock Recovery and Avoidance Mechanisms to Approach Message Dependent Deadlocks in on-chip Networks

EE 6900: Interconnection Networks for HPC Systems Fall 2016

Lecture: Interconnection Networks

Bursty Communication Performance Analysis of Network-on-Chip with Diverse Traffic Permutations

Wormhole Routing Techniques for Directly Connected Multicomputer Systems

BARP-A Dynamic Routing Protocol for Balanced Distribution of Traffic in NoCs

Routing Algorithms, Process Model for Quality of Services (QoS) and Architectures for Two-Dimensional 4 4 Mesh Topology Network-on-Chip

Towards A Formally Verified Network-on-Chip

Fault-Tolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults

CONGESTION AWARE ADAPTIVE ROUTING FOR NETWORK-ON-CHIP COMMUNICATION. Stephen Chui Bachelor of Engineering Ryerson University, 2012.

Generalized Theory for Deadlock-Free Adaptive Wormhole Routing and its Application to Disha Concurrent

Basic Switch Organization

Lecture: Transactional Memory, Networks. Topics: TM implementations, on-chip networks

A Literature Review of on-chip Network Design using an Agent-based Management Method

Packet Switch Architecture

Packet Switch Architecture

ECE 669 Parallel Computer Architecture

Application-Aware Deadlock-Free Oblivious Routing

Recall: The Routing problem: Local decisions. Recall: Multidimensional Meshes and Tori. Properties of Routing Algorithms

FT-Z-OE: A Fault Tolerant and Low Overhead Routing Algorithm on TSV-based 3D Network on Chip Links

A NEW DEADLOCK-FREE FAULT-TOLERANT ROUTING ALGORITHM FOR NOC INTERCONNECTIONS

Lecture 25: Interconnection Networks, Disks. Topics: flow control, router microarchitecture, RAID

Design and Evaluation of a Fault-Tolerant Adaptive Router for Parallel Computers

Sanaz Azampanah Ahmad Khademzadeh Nader Bagherzadeh Majid Janidarmian Reza Shojaee

Lecture 7: Flow Control - I

Design and Implementation of Buffer Loan Algorithm for BiNoC Router

Performance Evaluation of Different Routing Algorithms in Network on Chip

MESH-CONNECTED networks have been widely used in

Fault-tolerant & Adaptive Stochastic Routing Algorithm. for Network-on-Chip. Team CoheVer: Zixin Wang, Rong Xu, Yang Jiao, Tan Bie

High Performance Interconnect and NoC Router Design

A Hybrid Interconnection Network for Integrated Communication Services

Routing and Deadlock

Authors Neetu Soni 1, Khemraj Deshmukh 2. Deparment of Electronics and Telecommunication,CSVTU,Bhilai,C.G.,India

NOW Handout Page 1. Outline. Networks: Routing and Design. Routing. Routing Mechanism. Routing Mechanism (cont) Properties of Routing Algorithms

HARDWARE IMPLEMENTATION OF PIPELINE BASED ROUTER DESIGN FOR ON- CHIP NETWORK

4. Networks. in parallel computers. Advances in Computer Architecture

in Oblivious Routing

A Survey of Routing Techniques in Store-and-Forward and Wormhole Interconnects

Fault-Tolerant Routing in Fault Blocks. Planarly Constructed. Dong Xiang, Jia-Guang Sun, Jie. and Krishnaiyan Thulasiraman. Abstract.

PERFORMANCE EVALUATION OF FAULT TOLERANT METHODOLOGIES FOR NETWORK ON CHIP ARCHITECTURE

A VERIOG-HDL IMPLEMENTATION OF VIRTUAL CHANNELS IN A NETWORK-ON-CHIP ROUTER. A Thesis SUNGHO PARK

Fault-Tolerant Multiple Task Migration in Mesh NoC s over virtual Point-to-Point connections

FPGA based Design of Low Power Reconfigurable Router for Network on Chip (NoC)

Low Cost Network on Chip Router Design for Torus Topology

Topologies. Maurizio Palesi. Maurizio Palesi 1

Architecture and Design of Efficient 3D Network-on-Chip for Custom Multi-Core SoC

Fault-Tolerant Routing Algorithm in Meshes with Solid Faults

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 22, NO. 1, JANUARY

Dynamic Router Design For Reliable Communication In Noc

SOFTWARE BASED FAULT-TOLERANT OBLIVIOUS ROUTING IN PIPELINED NETWORKS*

Fault-Tolerant and Deadlock-Free Routing in 2-D Meshes Using Rectilinear-Monotone Polygonal Fault Blocks

Quest for High-Performance Bufferless NoCs with Single-Cycle Express Paths and Self-Learning Throttling

Lecture 14: Large Cache Design III. Topics: Replacement policies, associativity, cache networks, networking basics

Topologies. Maurizio Palesi. Maurizio Palesi 1

PDA-HyPAR: Path-Diversity-Aware Hybrid Planar Adaptive Routing Algorithm for 3D NoCs

Performance Analysis of NoC Architectures

Interconnection Networks: Flow Control. Prof. Natalie Enright Jerger

Designing and Implementation of a Network on Chip Router Based on Handshaking Communication Mechanism

Wide area networks: packet switching and congestion

Bandwidth Aware Routing Algorithms for Networks-on-Chip

Transcription:

NOC Deadlock and Livelock 1

Deadlock (When?) Deadlock can occur in an interconnection network, when a group of packets cannot make progress, because they are waiting on each other to release resource (buffers, channels) If a sequence of waiting agents form a cycle the network is deadlocked 2

Deadlock (Why?) Deadlock can occur if packets are allowed to hold some resources while requesting others Switching Technique Resource Store and Forward Buffer Virtual Cut-Through Buffer Wormhole Channel Because blocked packets holding channels (and their corrisponding flit buffers) remain in the network Wormhole routing is particularly susceptible to deadlock 3

Wormhole Routing Deadlock Example Packet 4 A B Packet 3 Packet 1 B Packet 2 A Packet 3 C Packet 4 D Flit buffer Input selection circuit Packet progression C D Packet awaiting resource Packet 1 Packet 2 4

Wormhole Routing Deadlock Example Packet 4 A B Packet 3 Packet 1 B Packet 2 A Packet 3 C Packet 4 D Flit buffer Input selection circuit Packet progression C D Packet awaiting resource Packet 1 Packet 2 5

Wormhole Routing Deadlock Example A Packet 3 B Packet 1 B Packet 2 A Packet 3 C Packet 4 D Packet 2 Flit buffer Input selection circuit Packet progression Packet 4 C D Packet awaiting resource Packet 1 6

Wormhole Routing Deadlock Example A Packet 3 B Packet 1 B Packet 2 A Packet 3 C Packet 4 D Packet 2 Flit buffer Input selection circuit Packet progression Packet 4 C D Packet awaiting resource Packet 1 7

How to Solve Deadlock Problems Allow the preemption of packets involved in a potential deadlock situation Preemption packets can be Rerouted Adaptive nonminimal routing techniques Discarded Packets recovered at the source and restransmitted Not used in most direct networks architectures Requirements of low-latency and reliability 8

How to Solve Deadlock Problems More commonly, deadlock is avoided by the routing algorithm By ordering network resources and requiring that packets use these resources in strictly monotonic order Circular wait is avoided 9

Channel Dependecy Graph In wormhole routing networks channels are the critical resources There is a Direct Dependency from l i to l j if l j can be used immediately after l i by messages destined to some node n The Channel Dependency Graph for a network and a routing algorithm is a direct graph D=G(L,D) L consists of all the unidirectional channels in the network D includes the pairs (l i, l j ) if there is a direct dependency from l i to l j 10

Duato s Theorem A routing function R is deadlock-free if there are no cycles in its channel dependency graph 11

Channel Dependency Graph Method The routing is still minimal However, to send a packet from 0 to 2, the packet must be forwarded through node 3 12

Deterministic Routing An approach to designing a deadlock-free routing algorithm for a wormhole-routed network is to ensure that cycles are avoided in the channel dependency graph Assign a unique number to each channel Allocate channels to packets in strictly ascending (or descending) order If the behavior of the algorithm is independent of current network conditions Deterministic routing 13

Dimension-ordered Routing Each packet is routed in one dimension at a time Arriving at the proper coordinate in each dimension before proceeding to the next dimension Enforcing a strictly monotonic order on the dimension traversed S1 D3 S2 D2 S3 D1 14

Adaptive Routing The main problem of a deterministic routing is that it cannot respond to dynamic network conditions Congestion Faults Adaptive routing must address deadlock issue 15

The Turn Model The Turn Model provide a systematic approach to the development of maximally adaptive routing algorithms 1. Classify channels according to the direction in which they route packets 2. Identify the turns that occur between one direction and another 3. Identify the simple cycles these turns can forms 4. Prohibit one turn in each cycle 16

The Turn Model Abstract cycles in a 2D mesh Four turns allowed in XY routing Six turns allowed in west-first routing 17

West-First Routing S Fully adaptive Deterministic First route a packet west, if necessary, and then adaptively south, east, and north The algorithm is fully adaptive if the destination is on the right-hand side (east) of the source Otherwise it is deterministic 18

Routing Algorithms based on Turn Model North-last S Fully adaptive Deterministic Negative-first S Fully adaptive Deterministic 19

2024 © technodocbox.com Privacy Policy | Terms of Service | Feedback