Basic Low Level Concepts
|
|
- Junior Bryant
- 6 years ago
- Views:
Transcription
1 Course Outline Basic Low Level Concepts Case Studies Operation through multiple switches: Topologies & Routing v Direct, indirect, regular, irregular Formal models and analysis for deadlock and livelock freedom Operation through a single switch: Router micro-architectures v Buffering, arbitration, scheduling, datapath Operation of a single link: switching and flow control Optimization: technology, congestion, reliability Sudhakar Yalamanchili, Georgia Institute of Technology (except as indicated) ECE 8813a (2) Overview Sources Main architectural issues for communication over a single link v Message units v Flow control (lossless links) v Switching (next) v Buffer management (later) v Arbitration & Scheduling (later) Chapters 1 & 2 v Interconnection Networks: An Engineering Approach, J. Duato, S. Yalamanchili and L. Ni, Morgan Kaufmann (pubs.) Papers v Virtual Channel Flow Control v Optimistic Flow Control Illinois Fast Messages System Goals: high levels of link utilization and minimal impact on end-to-end latency ECE 8813a (3) ECE 8813a (4) 1
2 Message Passing Communication Protocol v Typical steps followed by the sender: 1. System call by application n Copies the data into OS and/or network interface memory n Packetizes the message (if needed) n Prepares headers and trailers of packets 2. Checksum is computed and added to header/trailer 3. Timer is started and the network interface sends the packets processor memory ni ni memory processor Message Passing Communication Protocol v Typical steps followed by the receiver: 1. NI allocates received packets into its memory or OS memory 2. Checksum is computed and compared for each packet n If checksum matches, NI sends back an ACK packet 3. Once all packets are correctly received processor n n The message is reassembled and copied to user's address The corresponding application is signalled (via polling or interrupt) memory ni ni memory processor register file proc/mem user system IO or proc/mem FIFO Interconnection network packet FIFO IO or proc/mem user system proc/mem register file register file proc/mem user system IO or proc/mem FIFO Interconnection network packet FIFO IO or proc/mem user system proc/mem register file user writes data in memory system call sends 1 copy pipelined transfer e.g., DMA ECE 8813a (5) pipelined reception e.g., DMA interrupt data 2 copy ECE 8813a ready (6) Shared Memory L2 miss v Miss Status Handling Register (MSHR) allocation, address mapping, packet construction v Message injection, flow control set-up, rate control Message reception v Packet ejection, update message status (return), and control processing (end-to-end flow control) v Packet servicing, message injection Shared Memory L2 miss v Miss Status Handling Register (MSHR) allocation, address mapping, packet construction v Message injection, flow control set-up, rate control Message reception v Packet ejection, update message status (return), and control processing (end-to-end flow control) v Packet servicing, message injection thewere42.worldpress.com ECE 8813a (7) ECE 8813a (8) 2
3 The Network Model Link Traversal Basic Switch Microarchitecture Switch Traversal Metrics (for now): latency and bandwidth Physical channel Link Control Route Computation DEMUX... MUX DEMUX... MUX Link Control Physical channel Routing, switching, flow control, error control Physical channel Link Control Route Computation DEMUX... MUX CrossBar DEMUX... MUX Link Control Physical channel Route Computation Switch & VC Allocation D hops L bit message W bit wide channels message path ECE 8813a (9) ECE 8813a (10) On-Chip Wide links Shallow pipelines Not pin limited Low flow control latency Smaller buffers Off-Chip vs. On-Chip Off-Chip Narrow links Deeper pipelines Pin limited Larger flow control latency Deeper buffers Routing Layer Switching Layer Physical Layer The Hardware Message Stack Where?: Destination decisions, i.e., which output port When?: When is data forwarded How?: synchronization of data transfer Largely responsible for deadlock and livelock properties Largely responsible for latency, bandwidth and energy properties Switching is tightly coupled with flow control & buffer management Relative timing is key to performance ECE 8813a (11) ECE 8813a (12) 3
4 Messaging Units Data/Message Packets Flits: flow control digits type head Dest Info Seq # misc tail Phits: physical flow control digits Link Level Flow Control Data is transmitted based on a hierarchical data structuring mechanism v Messages à packets à s à phits v While s and phits are fixed size, packets and data may be variable sized ECE 8813a (13) Sudhakar Yalamanchili, Georgia Institute of Technology (except as indicated) Flow Control A synchronization protocol for the lossless transmission of bits Determines how network resources are allocated v Buffers Determines how conflicts are resolved v How (e.g., priorities) and when resources are assigned For Synchronized Transfers Acknowledge Receipt Unit of synchronized communication v Smallest unit whose transfer is requested by the sender and acknowledged by the receiver v No restriction on the relative timing of control vs. data transfers v Is a form of backpressure ECE 8813a (15) ECE 8813a (16) 4
5 For Buffer Management Physical Channel Flow Control Buffer availability information Flow control occurs at two levels v Level of buffer management (s/packets) v Level of physical transfers (phits) v Relationship between s and phits is machine & technology specific What if there are no buffers? v Bufferless switching/flow control (later) Asynchronous Flow Control What is the limiting factor on link throughput? Synchronous Flow Control How is buffer availability indicated? ECE 8813a (17) ECE 8813a (18) Flow Control Mechanisms Credit-Based Flow Control Credit Based flow control On/off flow control Optimistic/Reliable Flow control Virtual Channel Flow Control Basic Network Structure and Functions v Credit-based flow control Sender sends packets whenever credit counter is not zero sender Credit counter 9 pipelined transfer receiver X Queue is not serviced ECE 8813a (19) ECE 8813a (20) 5
6 Credit-Based Flow Control Timeline* Basic Network Structure and Functions v Credit-based flow control Sender resumes injection sender Credit counter 9 pipelined transfer Receiver sends credits after they become available +5 receiver X Node 1 Node 2 credit process credit process credit Round trip credit time equivalently expressed in number of flow control buffer units - t rt Queue is not serviced credit ECE 8813a (21) *From W. J. Dally & B. Towles, Principles and Practices of Interconnection Networks, Morgan Kaufmann, 2004 ECE 8813a (22) Performance of Credit Based Schemes The control bandwidth can be reduced by submitting block credits Basic Network Structure and Functions v /Xoff flow control On/Off Flow Control Buffers must be sized to maximize link utilization v Large enough to host packets in transit Xoff sender Control bit a packet is injected if control bit is in Xoff receiver # buffers F trt b Lf link bandwidth pipelined transfer size *From W. J. Dally & B. Towles, Principles and Practices of Interconnection Networks, Morgan Kaufmann, 2004 ECE 8813a (23) ECE 8813a (24) 6
7 Basic Network Structure and Functions v /Xoff flow control On-Off Flow Control Basic Network Structure and Functions v /Xoff flow control On-Off Flow Control Xoff sender When in Xoff, sender cannot inject packets When Xoff threshold is reached, an Xoff notification is sent receiver Xoff sender When threshold is reached, an notification is sent receiver Control bit Xoff Control bit Xoff pipelined transfer X pipelined transfer X Queue is not serviced Queue is not serviced ECE 8813a (25) ECE 8813a (26) Node 1 Node 2 off process FC Timeline* Hit the high water mark (stop) Stop Go Performance of On-Off Schemes Buffer sizing and position of Stop and Go watermarks To operate at full speed buffer size must be at least 2F on Stop Go trt b F Lf Hit the low water mark (go) *From W. J. Dally & B. Towles, Principles and Practices of Interconnection Networks, Morgan Kaufmann, 2004 ECE 8813a (27) *From W. J. Dally & B. Towles, Principles and Practices of Interconnection Networks, Morgan Kaufmann, 2004 ECE 8813a (28) 7
8 Comparison of Flow Control Schemes Basic Network Structure and Functions v Comparison of /Xoff vs credit-based flow control Comparing Credit-Based & On/Off Flow Control Both schemes can fully utilize buffers Stop & Go Credit based Stop Go Stop signal Sender Last packet returned by stops reaches receiver receiver transmission buffer # credits returned to sender Sender Last packet uses reaches receiver last credit buffer Stop Go Packets in buffer get processed Stop Go Packets get Sender processed and transmits credits returned packets Go signal returned to sender Stop Go Sender resumes transmission First packet reaches buffer First packet Time reaches Flow control latency buffer observed by receiver buffer Time Restart latency is lower for credit-based schemes and therefore v Credit-based flow control has higher average buffer occupancy at high loads v Credit-based flow control leads to higher throughput at high loads v Smaller inter-packet gap ECE 8813a (29) ECE 8813a (30) Comparing Credit-Based & On/Off Flow Control (cont.) Control traffic is higher for credit schemes v Block credits can be used to tune link behavior Buffer sizes are independent of round trip latency for credit schemes (at the expense of performance) v Not true for On/Off without dropping packets Credit schemes have higher information content à useful for QoS schemes On-off schemes better suited for many to one relationships Sending Reject Queue Network Interface Optimistic Flow Control Net ACK/NACK Network Interface Optimistically send messages v Allocate for returned messages v Deallocate on reception of Ack v Retransmit on reception of Nack Buffer sizes are proportional to the number of packets rather than the number of senders Receiving ECE 8813a (31) ECE 8813a (32) 8
9 Reliable Flow Control Reliable Flow Control Sending Network Interface Net ACK/NACK Network Interface Receiving Sending Network Interface ACK Net Network Interface Receiving Transmit packets when available v De-allocate when reception is acknowledged v Re-transmit if packet is dropped (and negative ACK is received) Derived from traditional telecom networks v Employed over long and error prone links v Extended to operate over the network à end-to-end last tx d packet Retransmission interval last ack d packet last rcv d packet Packets are tagged with sequence numbers Need to recycle sequence numbers Receiver acknowledges (Ack) received packets v Detect out of sequence reception v Time-outs to detect lost packets ECE 8813a (33) ECE 8813a (34) Sending ACK Reliable Flow Control Net Data structures to hold transmitted packets and the order in which they were transmitted v Utilize the send buffers o Go-back-N strategy v Maintain a separate data structure o Maintain original order v Minimize redundant transmissions v Block acknowledgements to minimize flow control bandwidth used Receiving Buffering Used for long and error prone links # buffers trt b F Lf link bandwidth size Also known as Ack/Nack flow control ECE 8813a (35) ECE 8813a (36) 9
10 Optimism Optimistic/Reliable Flow Control v Inefficient/increased buffer usage o Messages held at source o Re-ordering may be required due to out of order reception Reliable v Must deal with out-of-order reception v Need sophisticated buffer management schemes for multi-source control Generally give way to credit-schemes or stopand-go schemes v Small buffers à credit-based v Large buffers à stop-and-go A A B B Virtual Channel Flow Control Channels and buffers are dynamically allocated network resources Physical channels are idle when messages block ECE 8813a (37) ECE 8813a (38) Virtual Channels Virtual Channel Flow Control Per VC state status credits vc state Output packet Output buffers DEMUX... MUX Link Control Unidirectional Physical Channel Link Control Input buffers DEMUX... MUX Each virtual channel is a unidirectional channel v Independently managed buffers multiplexed over the physical channel Each channel is independently flow controlled Improves performance through reduction of blocking delay Important in realizing deadlock freedom (later) type VC Virtual Channels As the number of virtual channels increase, the increased channel multiplexing has multiple effects (more later) v Overall performance v Router complexity and critical path Flits/phits must now record VC information v Or send VC information out of band ECE 8813a (39) ECE 8813a (40) 10
11 Intel Single Chip Cloud Computer (SCC) Intel SCC Message Format Memory Controller V 1 Memory Controller Flit Types: Null Credit Body/tail control Memory Controller V 2 Memory Controller n 24 dual core tiles n 8 voltage and 28 frequency islands n X-Y routed mesh: 144 bit physical channels ECE 8813a (41) J. Howard et. Al, A 48-Core IA-32 Processor in 45 nm CMOS Using On-Die Message-Passing and DVFS for Performance and Power Scaling. IEEE Journal of Solid-State Circuits, vol. 46, no. 1, January ECE 8813a (42) Flow Control: Global View Flow control parameters are tuned based on link length, link width and processing overhead at the end-points Effective FC and buffer management is necessary for high link utilizations à network throughput v In-band vs. out of band flow control Flow Control: Global View Latency: overlapping FC, buffer management and switching à impacts end-to-end latency In-band vs. out-of band flow control v Use link bandwidth vs. additional side-band signals Links maybe non-uniform, e.g., lengths/widths on chips v Buffer sizing for long links ECE 8813a (43) ECE 8813a (44) 11
12 Commercial Examples AMD HyperTransport credit based Intel QuickPath credit based Infiniband credit based Ethernet On/Off Myrinet Stop-and-Go PCI Express credit based IBM Blue Gene token flow control Cray T3E credit based Some Research Questions Reliable Flow Control v PVT effects for high speed links v Encoding schemes, e.g., for power efficiency Adaptive flow control v Buffer and congestion management v Quality of Service (QoS) End-to-End v Flow control for multicast v Multisource flow control (networks) Low power designs v Error rate vs. voltage scaling v Link and buffer widths and depths v On-off schemes ECE 8813a (45) ECE 8813a (46) Summary Flow control, buffer management and switching are closely related and generally co-designed v Closest to the physical layer and directly impact utilization and latency v Object of significant tuning How are these schemes impacted by and integrated with switch designs? ECE 8813a (47) 12
Lecture 3: Flow-Control
High-Performance On-Chip Interconnects for Emerging SoCs http://tusharkrishna.ece.gatech.edu/teaching/nocs_acaces17/ ACACES Summer School 2017 Lecture 3: Flow-Control Tushar Krishna Assistant Professor
More informationLecture: Interconnection Networks. Topics: TM wrap-up, routing, deadlock, flow control, virtual channels
Lecture: Interconnection Networks Topics: TM wrap-up, routing, deadlock, flow control, virtual channels 1 TM wrap-up Eager versioning: create a log of old values Handling problematic situations with a
More informationInput Buffering (IB): Message data is received into the input buffer.
TITLE Switching Techniques BYLINE Sudhakar Yalamanchili School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta, GA. 30332 sudha@ece.gatech.edu SYNONYMS Flow Control DEFITION
More informationInterconnection Networks: Flow Control. Prof. Natalie Enright Jerger
Interconnection Networks: Flow Control Prof. Natalie Enright Jerger Switching/Flow Control Overview Topology: determines connectivity of network Routing: determines paths through network Flow Control:
More informationLecture 12: Interconnection Networks. Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E)
Lecture 12: Interconnection Networks Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E) 1 Topologies Internet topologies are not very regular they grew
More informationSwitching/Flow Control Overview. Interconnection Networks: Flow Control and Microarchitecture. Packets. Switching.
Switching/Flow Control Overview Interconnection Networks: Flow Control and Microarchitecture Topology: determines connectivity of network Routing: determines paths through network Flow Control: determine
More informationNetworks: Routing, Deadlock, Flow Control, Switch Design, Case Studies. Admin
Networks: Routing, Deadlock, Flow Control, Switch Design, Case Studies Alvin R. Lebeck CPS 220 Admin Homework #5 Due Dec 3 Projects Final (yes it will be cumulative) CPS 220 2 1 Review: Terms Network characterized
More informationEECS 570. Lecture 19 Interconnects: Flow Control. Winter 2018 Subhankar Pal
Lecture 19 Interconnects: Flow Control Winter 2018 Subhankar Pal http://www.eecs.umich.edu/courses/eecs570/ Slides developed in part by Profs. Adve, Falsafi, Hill, Lebeck, Martin, Narayanasamy, Nowatzyk,
More informationLecture 13: Interconnection Networks. Topics: lots of background, recent innovations for power and performance
Lecture 13: Interconnection Networks Topics: lots of background, recent innovations for power and performance 1 Interconnection Networks Recall: fully connected network, arrays/rings, meshes/tori, trees,
More informationLecture 16: On-Chip Networks. Topics: Cache networks, NoC basics
Lecture 16: On-Chip Networks Topics: Cache networks, NoC basics 1 Traditional Networks Huh et al. ICS 05, Beckmann MICRO 04 Example designs for contiguous L2 cache regions 2 Explorations for Optimality
More informationTDT Appendix E Interconnection Networks
TDT 4260 Appendix E Interconnection Networks Review Advantages of a snooping coherency protocol? Disadvantages of a snooping coherency protocol? Advantages of a directory coherency protocol? Disadvantages
More informationLecture: Interconnection Networks
Lecture: Interconnection Networks Topics: Router microarchitecture, topologies Final exam next Tuesday: same rules as the first midterm 1 Packets/Flits A message is broken into multiple packets (each packet
More informationSynchronized Progress in Interconnection Networks (SPIN) : A new theory for deadlock freedom
ISCA 2018 Session 8B: Interconnection Networks Synchronized Progress in Interconnection Networks (SPIN) : A new theory for deadlock freedom Aniruddh Ramrakhyani Georgia Tech (aniruddh@gatech.edu) Tushar
More informationDeadlock. Reading. Ensuring Packet Delivery. Overview: The Problem
Reading W. Dally, C. Seitz, Deadlock-Free Message Routing on Multiprocessor Interconnection Networks,, IEEE TC, May 1987 Deadlock F. Silla, and J. Duato, Improving the Efficiency of Adaptive Routing in
More informationRouting Algorithm. How do I know where a packet should go? Topology does NOT determine routing (e.g., many paths through torus)
Routing Algorithm How do I know where a packet should go? Topology does NOT determine routing (e.g., many paths through torus) Many routing algorithms exist 1) Arithmetic 2) Source-based 3) Table lookup
More informationMinBD: Minimally-Buffered Deflection Routing for Energy-Efficient Interconnect
MinBD: Minimally-Buffered Deflection Routing for Energy-Efficient Interconnect Chris Fallin, Greg Nazario, Xiangyao Yu*, Kevin Chang, Rachata Ausavarungnirun, Onur Mutlu Carnegie Mellon University *CMU
More informationNoC Test-Chip Project: Working Document
NoC Test-Chip Project: Working Document Michele Petracca, Omar Ahmad, Young Jin Yoon, Frank Zovko, Luca Carloni and Kenneth Shepard I. INTRODUCTION This document describes the low-power high-performance
More informationModule 17: "Interconnection Networks" Lecture 37: "Introduction to Routers" Interconnection Networks. Fundamentals. Latency and bandwidth
Interconnection Networks Fundamentals Latency and bandwidth Router architecture Coherence protocol and routing [From Chapter 10 of Culler, Singh, Gupta] file:///e /parallel_com_arch/lecture37/37_1.htm[6/13/2012
More informationQuest for High-Performance Bufferless NoCs with Single-Cycle Express Paths and Self-Learning Throttling
Quest for High-Performance Bufferless NoCs with Single-Cycle Express Paths and Self-Learning Throttling Bhavya K. Daya, Li-Shiuan Peh, Anantha P. Chandrakasan Dept. of Electrical Engineering and Computer
More informationPacket Switch Architecture
Packet Switch Architecture 3. Output Queueing Architectures 4. Input Queueing Architectures 5. Switching Fabrics 6. Flow and Congestion Control in Sw. Fabrics 7. Output Scheduling for QoS Guarantees 8.
More informationPacket Switch Architecture
Packet Switch Architecture 3. Output Queueing Architectures 4. Input Queueing Architectures 5. Switching Fabrics 6. Flow and Congestion Control in Sw. Fabrics 7. Output Scheduling for QoS Guarantees 8.
More informationInterconnection Networks
Lecture 18: Interconnection Networks Parallel Computer Architecture and Programming CMU 15-418/15-618, Spring 2015 Credit: many of these slides were created by Michael Papamichael This lecture is partially
More informationAdvanced Computer Networks. Flow Control
Advanced Computer Networks 263 3501 00 Flow Control Patrick Stuedi Spring Semester 2017 1 Oriana Riva, Department of Computer Science ETH Zürich Last week TCP in Datacenters Avoid incast problem - Reduce
More informationLecture 7: Flow Control - I
ECE 8823 A / CS 8803 - ICN Interconnection Networks Spring 2017 http://tusharkrishna.ece.gatech.edu/teaching/icn_s17/ Lecture 7: Flow Control - I Tushar Krishna Assistant Professor School of Electrical
More informationLecture: Transactional Memory, Networks. Topics: TM implementations, on-chip networks
Lecture: Transactional Memory, Networks Topics: TM implementations, on-chip networks 1 Summary of TM Benefits As easy to program as coarse-grain locks Performance similar to fine-grain locks Avoids deadlock
More informationES1 An Introduction to On-chip Networks
December 17th, 2015 ES1 An Introduction to On-chip Networks Davide Zoni PhD mail: davide.zoni@polimi.it webpage: home.dei.polimi.it/zoni Sources Main Reference Book (for the examination) Designing Network-on-Chip
More informationRouting Algorithms, Process Model for Quality of Services (QoS) and Architectures for Two-Dimensional 4 4 Mesh Topology Network-on-Chip
Routing Algorithms, Process Model for Quality of Services (QoS) and Architectures for Two-Dimensional 4 4 Mesh Topology Network-on-Chip Nauman Jalil, Adnan Qureshi, Furqan Khan, and Sohaib Ayyaz Qazi Abstract
More informationChapter 1 Bufferless and Minimally-Buffered Deflection Routing
Chapter 1 Bufferless and Minimally-Buffered Deflection Routing Chris Fallin, Greg Nazario, Xiangyao Yu, Kevin Chang, Rachata Ausavarungnirun, Onur Mutlu Abstract A conventional Network-on-Chip (NoC) router
More informationNOC: Networks on Chip SoC Interconnection Structures
NOC: Networks on Chip SoC Interconnection Structures COE838: Systems-on-Chip Design http://www.ee.ryerson.ca/~courses/coe838/ Dr. Gul N. Khan http://www.ee.ryerson.ca/~gnkhan Electrical and Computer Engineering
More informationNetworks. Distributed Systems. Philipp Kupferschmied. Universität Karlsruhe, System Architecture Group. May 6th, 2009
Networks Distributed Systems Philipp Kupferschmied Universität Karlsruhe, System Architecture Group May 6th, 2009 Philipp Kupferschmied Networks 1/ 41 1 Communication Basics Introduction Layered Communication
More informationLecture 24: Interconnection Networks. Topics: topologies, routing, deadlocks, flow control
Lecture 24: Interconnection Networks Topics: topologies, routing, deadlocks, flow control 1 Topology Examples Grid Torus Hypercube Criteria Bus Ring 2Dtorus 6-cube Fully connected Performance Bisection
More informationFlow Control can be viewed as a problem of
NOC Flow Control 1 Flow Control Flow Control determines how the resources of a network, such as channel bandwidth and buffer capacity are allocated to packets traversing a network Goal is to use resources
More informationInterconnection Networks
Lecture 17: Interconnection Networks Parallel Computer Architecture and Programming A comment on web site comments It is okay to make a comment on a slide/topic that has already been commented on. In fact
More informationLow-Power Interconnection Networks
Low-Power Interconnection Networks Li-Shiuan Peh Associate Professor EECS, CSAIL & MTL MIT 1 Moore s Law: Double the number of transistors on chip every 2 years 1970: Clock speed: 108kHz No. transistors:
More informationArchitecture or Parallel Computers CSC / ECE 506
Architecture or Parallel Computers CSC / ECE 506 Summer 2006 Scalable Programming Models 6/19/2006 Dr Steve Hunter Back to Basics Parallel Architecture = Computer Architecture + Communication Architecture
More informationAchieving Lightweight Multicast in Asynchronous Networks-on-Chip Using Local Speculation
Achieving Lightweight Multicast in Asynchronous Networks-on-Chip Using Local Speculation Kshitij Bhardwaj Dept. of Computer Science Columbia University Steven M. Nowick 2016 ACM/IEEE Design Automation
More informationAbstract. Paper organization
Allocation Approaches for Virtual Channel Flow Control Neeraj Parik, Ozen Deniz, Paul Kim, Zheng Li Department of Electrical Engineering Stanford University, CA Abstract s are one of the major resources
More informationRouting Algorithms. Review
Routing Algorithms Today s topics: Deterministic, Oblivious Adaptive, & Adaptive models Problems: efficiency livelock deadlock 1 CS6810 Review Network properties are a combination topology topology dependent
More informationEvaluating Bufferless Flow Control for On-Chip Networks
Evaluating Bufferless Flow Control for On-Chip Networks George Michelogiannakis, Daniel Sanchez, William J. Dally, Christos Kozyrakis Stanford University In a nutshell Many researchers report high buffer
More informationLecture 15: PCM, Networks. Today: PCM wrap-up, projects discussion, on-chip networks background
Lecture 15: PCM, Networks Today: PCM wrap-up, projects discussion, on-chip networks background 1 Hard Error Tolerance in PCM PCM cells will eventually fail; important to cause gradual capacity degradation
More informationAdvanced Computer Networks. Flow Control
Advanced Computer Networks 263 3501 00 Flow Control Patrick Stuedi, Qin Yin, Timothy Roscoe Spring Semester 2015 Oriana Riva, Department of Computer Science ETH Zürich 1 Today Flow Control Store-and-forward,
More informationLecture 25: Interconnection Networks, Disks. Topics: flow control, router microarchitecture, RAID
Lecture 25: Interconnection Networks, Disks Topics: flow control, router microarchitecture, RAID 1 Virtual Channel Flow Control Each switch has multiple virtual channels per phys. channel Each virtual
More informationLecture 12: Interconnection Networks. Topics: dimension/arity, routing, deadlock, flow control
Lecture 12: Interconnection Networks Topics: dimension/arity, routing, deadlock, flow control 1 Interconnection Networks Recall: fully connected network, arrays/rings, meshes/tori, trees, butterflies,
More informationDynamic Packet Fragmentation for Increased Virtual Channel Utilization in On-Chip Routers
Dynamic Packet Fragmentation for Increased Virtual Channel Utilization in On-Chip Routers Young Hoon Kang, Taek-Jun Kwon, and Jeff Draper {youngkan, tjkwon, draper}@isi.edu University of Southern California
More informationConnection-oriented Multicasting in Wormhole-switched Networks on Chip
Connection-oriented Multicasting in Wormhole-switched Networks on Chip Zhonghai Lu, Bei Yin and Axel Jantsch Laboratory of Electronics and Computer Systems Royal Institute of Technology, Sweden fzhonghai,axelg@imit.kth.se,
More informationNetworks-on-Chip Router: Configuration and Implementation
Networks-on-Chip : Configuration and Implementation Wen-Chung Tsai, Kuo-Chih Chu * 2 1 Department of Information and Communication Engineering, Chaoyang University of Technology, Taichung 413, Taiwan,
More informationOFAR-CM: Efficient Dragonfly Networks with Simple Congestion Management
Marina Garcia 22 August 2013 OFAR-CM: Efficient Dragonfly Networks with Simple Congestion Management M. Garcia, E. Vallejo, R. Beivide, M. Valero and G. Rodríguez Document number OFAR-CM: Efficient Dragonfly
More informationLecture 22: Router Design
Lecture 22: Router Design Papers: Power-Driven Design of Router Microarchitectures in On-Chip Networks, MICRO 03, Princeton A Gracefully Degrading and Energy-Efficient Modular Router Architecture for On-Chip
More informationUltra-Fast NoC Emulation on a Single FPGA
The 25 th International Conference on Field-Programmable Logic and Applications (FPL 2015) September 3, 2015 Ultra-Fast NoC Emulation on a Single FPGA Thiem Van Chu, Shimpei Sato, and Kenji Kise Tokyo
More information4. Networks. in parallel computers. Advances in Computer Architecture
4. Networks in parallel computers Advances in Computer Architecture System architectures for parallel computers Control organization Single Instruction stream Multiple Data stream (SIMD) All processors
More information1/5/2012. Overview of Interconnects. Presentation Outline. Myrinet and Quadrics. Interconnects. Switch-Based Interconnects
Overview of Interconnects Myrinet and Quadrics Leading Modern Interconnects Presentation Outline General Concepts of Interconnects Myrinet Latest Products Quadrics Latest Release Our Research Interconnects
More informationDeadlock: Part II. Reading Assignment. Deadlock: A Closer Look. Types of Deadlock
Reading Assignment T. M. Pinkston, Deadlock Characterization and Resolution in Interconnection Networks, Chapter 13 in Deadlock Resolution in Computer Integrated Systems, CRC Press 2004 Deadlock: Part
More informationECE/CS 757: Advanced Computer Architecture II Interconnects
ECE/CS 757: Advanced Computer Architecture II Interconnects Instructor:Mikko H Lipasti Spring 2017 University of Wisconsin-Madison Lecture notes created by Natalie Enright Jerger Lecture Outline Introduction
More informationThomas Moscibroda Microsoft Research. Onur Mutlu CMU
Thomas Moscibroda Microsoft Research Onur Mutlu CMU CPU+L1 CPU+L1 CPU+L1 CPU+L1 Multi-core Chip Cache -Bank Cache -Bank Cache -Bank Cache -Bank CPU+L1 CPU+L1 CPU+L1 CPU+L1 Accelerator, etc Cache -Bank
More informationComparison of Deadlock Recovery and Avoidance Mechanisms to Approach Message Dependent Deadlocks in on-chip Networks
Comparison of Deadlock Recovery and Avoidance Mechanisms to Approach Message Dependent Deadlocks in on-chip Networks Andreas Lankes¹, Soeren Sonntag², Helmut Reinig³, Thomas Wild¹, Andreas Herkersdorf¹
More informationSOFTWARE BASED FAULT-TOLERANT OBLIVIOUS ROUTING IN PIPELINED NETWORKS*
SOFTWARE BASED FAULT-TOLERANT OBLIVIOUS ROUTING IN PIPELINED NETWORKS* Young-Joo Suh, Binh Vien Dao, Jose Duato, and Sudhakar Yalamanchili Computer Systems Research Laboratory Facultad de Informatica School
More informationLecture 14: Large Cache Design III. Topics: Replacement policies, associativity, cache networks, networking basics
Lecture 14: Large Cache Design III Topics: Replacement policies, associativity, cache networks, networking basics 1 LIN Qureshi et al., ISCA 06 Memory level parallelism (MLP): number of misses that simultaneously
More informationAdaptive Routing. Claudio Brunelli Adaptive Routing Institute of Digital and Computer Systems / TKT-9636
1 Adaptive Routing Adaptive Routing Basics Minimal Adaptive Routing Fully Adaptive Routing Load-Balanced Adaptive Routing Search-Based Routing Case Study: Adapted Routing in the Thinking Machines CM-5
More informationUNIT IV -- TRANSPORT LAYER
UNIT IV -- TRANSPORT LAYER TABLE OF CONTENTS 4.1. Transport layer. 02 4.2. Reliable delivery service. 03 4.3. Congestion control. 05 4.4. Connection establishment.. 07 4.5. Flow control 09 4.6. Transmission
More informationOutline: Connecting Many Computers
Outline: Connecting Many Computers Last lecture: sending data between two computers This lecture: link-level network protocols (from last lecture) sending data among many computers 1 Review: A simple point-to-point
More informationudirec: Unified Diagnosis and Reconfiguration for Frugal Bypass of NoC Faults
1/45 1/22 MICRO-46, 9 th December- 213 Davis, California udirec: Unified Diagnosis and Reconfiguration for Frugal Bypass of NoC Faults Ritesh Parikh and Valeria Bertacco Electrical Engineering & Computer
More informationEfficient Throughput-Guarantees for Latency-Sensitive Networks-On-Chip
ASP-DAC 2010 20 Jan 2010 Session 6C Efficient Throughput-Guarantees for Latency-Sensitive Networks-On-Chip Jonas Diemer, Rolf Ernst TU Braunschweig, Germany diemer@ida.ing.tu-bs.de Michael Kauschke Intel,
More informationInterconnection Networks
Lecture 15: Interconnection Networks Parallel Computer Architecture and Programming CMU 15-418/15-618, Spring 2016 Credit: some slides created by Michael Papamichael, others based on slides from Onur Mutlu
More informationCMPE150 Midterm Solutions
CMPE150 Midterm Solutions Question 1 Packet switching and circuit switching: (a) Is the Internet a packet switching or circuit switching network? Justify your answer. The Internet is a packet switching
More informationCommunication Performance in Network-on-Chips
Communication Performance in Network-on-Chips Axel Jantsch Royal Institute of Technology, Stockholm November 24, 2004 Network on Chip Seminar, Linköping, November 25, 2004 Communication Performance In
More informationEE382C Lecture 1. Bill Dally 3/29/11. EE 382C - S11 - Lecture 1 1
EE382C Lecture 1 Bill Dally 3/29/11 EE 382C - S11 - Lecture 1 1 Logistics Handouts Course policy sheet Course schedule Assignments Homework Research Paper Project Midterm EE 382C - S11 - Lecture 1 2 What
More informationOpenSMART: Single-cycle Multi-hop NoC Generator in BSV and Chisel
OpenSMART: Single-cycle Multi-hop NoC Generator in BSV and Chisel Hyoukjun Kwon and Tushar Krishna Georgia Institute of Technology Synergy Lab (http://synergy.ece.gatech.edu) hyoukjun@gatech.edu April
More informationPrediction Router: Yet another low-latency on-chip router architecture
Prediction Router: Yet another low-latency on-chip router architecture Hiroki Matsutani Michihiro Koibuchi Hideharu Amano Tsutomu Yoshinaga (Keio Univ., Japan) (NII, Japan) (Keio Univ., Japan) (UEC, Japan)
More informationNetworking for Data Acquisition Systems. Fabrice Le Goff - 14/02/ ISOTDAQ
Networking for Data Acquisition Systems Fabrice Le Goff - 14/02/2018 - ISOTDAQ Outline Generalities The OSI Model Ethernet and Local Area Networks IP and Routing TCP, UDP and Transport Efficiency Networking
More informationHARDWARE IMPLEMENTATION OF PIPELINE BASED ROUTER DESIGN FOR ON- CHIP NETWORK
DOI: 10.21917/ijct.2012.0092 HARDWARE IMPLEMENTATION OF PIPELINE BASED ROUTER DESIGN FOR ON- CHIP NETWORK U. Saravanakumar 1, R. Rangarajan 2 and K. Rajasekar 3 1,3 Department of Electronics and Communication
More informationAddress InterLeaving for Low- Cost NoCs
Address InterLeaving for Low- Cost NoCs Miltos D. Grammatikakis, Kyprianos Papadimitriou, Polydoros Petrakis, Marcello Coppola, and Michael Soulie Technological Educational Institute of Crete, GR STMicroelectronics,
More informationNetwork management and QoS provisioning - revise. When someone have to share the same resources is possible to consider two particular problems:
Revise notes Multiplexing & Multiple Access When someone have to share the same resources is possible to consider two particular problems:. multiplexing;. multiple access. The first one is a centralized
More informationUnder the Hood, Part 1: Implementing Message Passing
Lecture 27: Under the Hood, Part 1: Implementing Message Passing Parallel Computer Architecture and Programming CMU 15-418/15-618, Fall 2017 Today s Theme 2 Message passing model (abstraction) Threads
More informationGeneric Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture
Generic Architecture EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California,
More informationLecture 26: Interconnects. James C. Hoe Department of ECE Carnegie Mellon University
18 447 Lecture 26: Interconnects James C. Hoe Department of ECE Carnegie Mellon University 18 447 S18 L26 S1, James C. Hoe, CMU/ECE/CALCM, 2018 Housekeeping Your goal today get an overview of parallel
More informationEC 513 Computer Architecture
EC 513 Computer Architecture On-chip Networking Prof. Michel A. Kinsy Virtual Channel Router VC 0 Routing Computation Virtual Channel Allocator Switch Allocator Input Ports VC x VC 0 VC x It s a system
More informationEE482, Spring 1999 Research Paper Report. Deadlock Recovery Schemes
EE482, Spring 1999 Research Paper Report Deadlock Recovery Schemes Jinyung Namkoong Mohammed Haque Nuwan Jayasena Manman Ren May 18, 1999 Introduction The selected papers address the problems of deadlock,
More informationProtocol Specification
Protocol Specification Prof Pallapa. Venkataram Department of Electrical Communication Engineering Indian Institute of Science Bangalore 560012, India Objectives of the Chapter To define a formal specification
More informationPart 5: Link Layer Technologies. CSE 3461: Introduction to Computer Networking Reading: Chapter 5, Kurose and Ross
Part 5: Link Layer Technologies CSE 3461: Introduction to Computer Networking Reading: Chapter 5, Kurose and Ross 1 Outline PPP ATM X.25 Frame Relay 2 Point to Point Data Link Control One sender, one receiver,
More informationCRC. Implementation. Error control. Software schemes. Packet errors. Types of packet errors
CRC Implementation Error control An Engineering Approach to Computer Networking Detects all single bit errors almost all 2-bit errors any odd number of errors all bursts up to M, where generator length
More informationDeadlock-free XY-YX router for on-chip interconnection network
LETTER IEICE Electronics Express, Vol.10, No.20, 1 5 Deadlock-free XY-YX router for on-chip interconnection network Yeong Seob Jeong and Seung Eun Lee a) Dept of Electronic Engineering Seoul National Univ
More informationLecture 9: Bridging & Switching"
Lecture 9: Bridging & Switching" CSE 123: Computer Networks Alex C. Snoeren HW 2 due Wednesday! Lecture 9 Overview" Finishing up media access Contention-free methods (rings) Moving beyond one wire Link
More informationHWP2 Application level query routing HWP1 Each peer knows about every other beacon B1 B3
HWP2 Application level query routing HWP1 Each peer knows about every other beacon B2 B1 B3 B4 B5 B6 11-Feb-02 Computer Networks 1 HWP2 Query routing searchget(searchkey, hopcount) Rget(host, port, key)
More informationA Hybrid Interconnection Network for Integrated Communication Services
A Hybrid Interconnection Network for Integrated Communication Services Yi-long Chen Northern Telecom, Inc. Richardson, TX 7583 kchen@nortel.com Jyh-Charn Liu Department of Computer Science, Texas A&M Univ.
More informationA thesis presented to. the faculty of. In partial fulfillment. of the requirements for the degree. Master of Science. Yixuan Zhang.
High-Performance Crossbar Designs for Network-on-Chips (NoCs) A thesis presented to the faculty of the Russ College of Engineering and Technology of Ohio University In partial fulfillment of the requirements
More informationLecture 18: Communication Models and Architectures: Interconnection Networks
Design & Co-design of Embedded Systems Lecture 18: Communication Models and Architectures: Interconnection Networks Sharif University of Technology Computer Engineering g Dept. Winter-Spring 2008 Mehdi
More informationA closer look at network structure:
T1: Introduction 1.1 What is computer network? Examples of computer network The Internet Network structure: edge and core 1.2 Why computer networks 1.3 The way networks work 1.4 Performance metrics: Delay,
More informationEECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture
EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley,
More informationEE 6900: Interconnection Networks for HPC Systems Fall 2016
EE 6900: Interconnection Networks for HPC Systems Fall 2016 Avinash Karanth Kodi School of Electrical Engineering and Computer Science Ohio Uversity Athens, OH 45701 Email: kodi@ohio.edu 1 Acknowledgement:
More informationToward a Reliable Data Transport Architecture for Optical Burst-Switched Networks
Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks Dr. Vinod Vokkarane Assistant Professor, Computer and Information Science Co-Director, Advanced Computer Networks Lab University
More informationInterconnection Network Project EE482 Advanced Computer Organization May 28, 1999
Interconnection Network Project EE482 Advanced Computer Organization May 28, 1999 Group Members: Overview Tom Fountain (fountain@cs.stanford.edu) T.J. Giuli (giuli@cs.stanford.edu) Paul Lassa (lassa@relgyro.stanford.edu)
More informationPrevention Flow-Control for Low Latency Torus Networks-on-Chip
revention Flow-Control for Low Latency Torus Networks-on-Chip Arpit Joshi Computer Architecture and Systems Lab Department of Computer Science & Engineering Indian Institute of Technology, Madras arpitj@cse.iitm.ac.in
More informationChapter 13 TRANSPORT. Mobile Computing Winter 2005 / Overview. TCP Overview. TCP slow-start. Motivation Simple analysis Various TCP mechanisms
Overview Chapter 13 TRANSPORT Motivation Simple analysis Various TCP mechanisms Distributed Computing Group Mobile Computing Winter 2005 / 2006 Distributed Computing Group MOBILE COMPUTING R. Wattenhofer
More informationOptical Packet Switching
Optical Packet Switching DEISNet Gruppo Reti di Telecomunicazioni http://deisnet.deis.unibo.it WDM Optical Network Legacy Networks Edge Systems WDM Links λ 1 λ 2 λ 3 λ 4 Core Nodes 2 1 Wavelength Routing
More informationNetwork on Chip Architecture: An Overview
Network on Chip Architecture: An Overview Md Shahriar Shamim & Naseef Mansoor 12/5/2014 1 Overview Introduction Multi core chip Challenges Network on Chip Architecture Regular Topology Irregular Topology
More informationADVANCED COMPUTER NETWORKS
ADVANCED COMPUTER NETWORKS Congestion Control and Avoidance 1 Lecture-6 Instructor : Mazhar Hussain CONGESTION CONTROL When one part of the subnet (e.g. one or more routers in an area) becomes overloaded,
More informationCongestion Management in Lossless Interconnects: Challenges and Benefits
Congestion Management in Lossless Interconnects: Challenges and Benefits José Duato Technical University of Valencia (SPAIN) Conference title 1 Outline Why is congestion management required? Benefits Congestion
More informationIEEE , Token Rings. 10/11/06 CS/ECE UIUC, Fall
IEEE 802.11, Token Rings 10/11/06 CS/ECE 438 - UIUC, Fall 2006 1 Medium Access Control Wireless channel is a shared medium Need access control mechanism to avoid interference Why not CSMA/CD? 10/11/06
More informationA VERIOG-HDL IMPLEMENTATION OF VIRTUAL CHANNELS IN A NETWORK-ON-CHIP ROUTER. A Thesis SUNGHO PARK
A VERIOG-HDL IMPLEMENTATION OF VIRTUAL CHANNELS IN A NETWORK-ON-CHIP ROUTER A Thesis by SUNGHO PARK Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements
More informationInternet II. CS10 : Beauty and Joy of Computing. cs10.berkeley.edu. !!Senior Lecturer SOE Dan Garcia!!! Garcia UCB!
cs10.berkeley.edu CS10 : Beauty and Joy of Computing Internet II!!Senior Lecturer SOE Dan Garcia!!!www.cs.berkeley.edu/~ddgarcia CS10 L17 Internet II (1)! Why Networks?! Originally sharing I/O devices
More information