Interconnection Networks Lecture 8: February 12, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by Wanping Zhang.

Slides:

Advertisements

Similar presentations

Prof. Natalie Enright Jerger

Advertisements

CS 140 Lecture 16 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.

A Novel 3D Layer-Multiplexed On-Chip Network

1 CS 140L Lecture 8 System Design Professor CK Cheng CSE Dept. UC San Diego.

EECC694 - Shaaban #1 lec # 10 Spring Asynchronous Transfer Mode (ATM) ATM is a specific asynchronous packet-oriented information, multiplexing.

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

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

Flattened Butterfly: A Cost-Efficient Topology for High-Radix Networks ______________________________ John Kim, William J. Dally &Dennis Abts Presented.

Destination-Based Adaptive Routing for 2D Mesh Networks ANCS 2010 Rohit Sunkam Ramanujam Bill Lin Electrical and Computer Engineering University of California,

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

CS 140 Lecture 16 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.

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.

Interconnection Networks: Deadlock and Livelock Feb. 26 th, 2007 Prof. Chung-Kuan Cheng Transcribed by: Mohammad Al-Fares.

1 Lecture 24: Interconnection Networks Topics: topologies, routing, deadlocks, flow control Final exam reminders:  Plan well – attempt every question.

CSE 291-a Interconnection Networks Lecture 15: Router (cont’d) March 5, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by Ling.

CSE 291 Interconnection Networks Winter 2007 Lecture 6 February Prof. Chung-Kuan Cheng University of California San Diego.

CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 15 Introduction to Networks and the Internet.

CSE 291-a Interconnection Networks Lecture 10: Flow Control February 21, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by.

Interconnection Networks

CSE 246: Computer Arithmetic Algorithms and Hardware Design Instructor: Prof. Chung-Kuan Cheng Winter 2005 Lecture 1: Numbers.

CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 12 Introduction to Networks and the Internet.

CSE 291-a Interconnection Networks Lecture 7: February 7, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by Thomas Weng.

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

ROUTING PROTOCOL IGRP. REVIEW 4 Purpose of Router –determine best path to destination –pass the frames to the destination 4 Protocols –routed - used by.

1 Lecture 25: Interconnection Networks Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E) Review session,

CSE 140 Lecture 15 System Designs Professor CK Cheng CSE Dept. UC San Diego 1.

CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 14 Introduction to Networks and the Internet.

Network Devices By Scott Burden & Linnea Wong Hubs Intelligent hubs have console ports, to allow monitoring of the hubs status and port activity. Passive.

NETWORKING DEVICES  What is a networking device?  What are the different networking devices?

Dragonfly Topology and Routing

On-Chip Networks and Testing

High-Performance Networks for Dataflow Architectures Pravin Bhat Andrew Putnam.

Network Devices.

1 Lecture 7: Interconnection Network Part I: Basic Definitions Part II: Message Passing Multicomputers.

High-Level Interconnect Architectures for FPGAs An investigation into network-based interconnect systems for existing and future FPGA architectures Nick.

1 Lecture #2: Components of Network. Communication Subnetwork C o n t e n t s l Network Architecture: –Terminal Network –Computer Network l Data Transmission.

High-Level Interconnect Architectures for FPGAs Nick Barrow-Williams.

Network Architecture: Design Philosophies IS250 Spring 2010 John Chuang

Circuit & Packet Switching. ► Two ways of achieving the same goal. ► The transfer of data across networks. ► Both methods have advantages and disadvantages.

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

Anshul Kumar, CSE IITD CSL718 : Multiprocessors Interconnection Mechanisms Performance Models 20 th April, 2006.

CSE 291-a Interconnection Networks Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007.

Anshul Kumar, CSE IITD ECE729 : Advanced Computer Architecture Lecture 27, 28: Interconnection Mechanisms In Multiprocessors 29 th, 31 st March, 2010.

CSE 291A Interconnection Networks Instructor: Prof. Chung-Kuan, Cheng CSE Dept. UCSD Winter-2007.

Run-time Adaptive on-chip Communication Scheme 林孟諭 Dept. of Electrical Engineering National Cheng Kung University Tainan, Taiwan, R.O.C.

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

Local-Area Networks. Topology Defines the Structure of the Network – Physical topology – actual layout of the wire (media) – Logical topology – defines.

MASCON: A Single IC Solution to ATM Multi-Channel Switching With Embedded Multicasting Ali Mohammad Zareh Bidoki April 2002.

Internet Measurement and Analysis Vinay Ribeiro Shriram Sarvotham Rolf Riedi Richard Baraniuk Rice University.

The Difference Between Router and Switch Not everyone knows: ADVANTAGES OF SWITCH:  Switches offer higher performance than bridges and hubs.  Switches.

1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix F)

1 Lecture 14: Interconnection Networks Topics: dimension vs. arity, deadlock.

Effective bandwidth with link pipelining Pipeline the flight and transmission of packets over the links Overlap the sending overhead with the transport.

Corse Overview Miodrag Bolic ELG7187 Topics in Computers: Multiprocessor Systems on Chip.

Modeling and Evaluation of Fibre Channel Storage Area Networks

Interconnection structures

CSE 140 Lecture 14 System Designs

CSE 140 Lecture 14 System Designs

Local Area Networks Yiannos Mylonas.

Switching and High-Speed Networks

Introduction to Networks

Northwestern Lab for Internet and Security Technology (LIST) Yan Chen Department of Computer Science Northwestern University.

CSE 140 Lecture 15 System Designs

Lecture 14: Interconnection Networks

Data Center Architectures

EE382C Lecture 6 Adaptive Routing 4/14/11 What is tornado traffic?

CS 258 Parallel Computer Architecture Lecture 5 Routing (Con’t)

MACS: A Minimal Adaptive Routing Circuit Switched Architecture for Scalable and Parametric NoCs Rohit Kumar Dr. Ann Gordon-Ross Introduction MACS: A.

CSE 140 Lecture 16 System Designs

Presentation transcript:

Interconnection Networks Lecture 8: February 12, 2007 Prof. Chung-Kuan Cheng CSE Dept, UC San Diego Winter 2007 Transcribed by Wanping Zhang

Slicing & Dicing  Concentrator  Distributor  Slicing

Concentrator Sm ooth the load of bursty sources Make efficient use of channel bandwidth Concentrator factor:

Distributor  Takes one high bandwidth channel and distribute its packets over several lower bandwidth channels 1.Interface high bandwidth module with a network that has a lower bandwidth 2.Interface with a slower router 3.Fault tolerance

Bit Slicing Control signal

Dimension Slicing

Channel Slicing

Slicing Multi-Stage Networks 2*16 pin ports Diameter = 3 Switches: 4*4*4=64 16 pin ports Diameter = 2 Switches: 4*4*2=32 2 2

Routing Basics  Motivation: How to go from source to destination  Definition: Deterministic: Routing algorithm always choose the same path between source and destination Oblivious: Routing algorithms choose a route without considering the state of the network Adoptive: Routing algorithms adapt to the state of the network