1 / 9

CSE 291-a Interconnection Networks

CSE 291-a Interconnection Networks. Lecture 12: Deadlock Avoidance (Cont’d) Router February 28, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by Yi Zhu. Topics. Deadlock avoidance Restricted physical route (lecture 10) Resource classes

steeles
Télécharger la présentation

CSE 291-a Interconnection Networks

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. CSE 291-aInterconnection Networks Lecture 12: Deadlock Avoidance (Cont’d)Router February 28, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by Yi Zhu

  2. Topics • Deadlock avoidance • Restricted physical route (lecture 10) • Resource classes • Distance classes • Dateline (ring) • Duato’s protocol • Router Architecture

  3. Distance Classes • #classes >= diameter of network • At source, we inject packets into resource of class 0 • At each hop, the packet of class i acquires a resource of class i+1 • Use min routing

  4. Dateline (Ring) • There are two classes • A dateline cuts the ring into a string • At source, we inject packets into resources of class 0 • Packets remain in the same class, but jump to class 1 when crossing the dateline

  5. Dateline (Ring)

  6. Duato’s Protocol for Deadlock-Free Adaptive Algorithm • The underlying network is deadlock-free. The routing relation is R1: escape routing • Create new virtual resources and routing relation Rc • Rc -> R1 works as injection at the node. • R1 -> Rc not allowed

  7. Router Architecture state Physical channel Physical channel buffer

  8. Virtual Channel State • Virtual channel state fields: 5-vector GROPC • G: Global state • I (idle), • R (routing) • V (waiting for VC) • A (active) • C (waiting for credits) • R: Route, output port R for the packet • O: Output VC, output VC O of port R

  9. Virtual Channel State (Cont’d) • P: Pointers, flit head and flit tail pointers into the input buffer • C: Credit count, #credits C for VC O of port R

More Related