Advanced Computer Architecture Lecture 23

Slides:



Advertisements
Similar presentations
Shantanu Dutt Univ. of Illinois at Chicago
Advertisements

1 Lecture 12: Interconnection Networks Topics: dimension/arity, routing, deadlock, flow control.
1 Lecture 23: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Appendix E)
Advanced Topics in Algorithms and Data Structures An overview of the lecture 2 Models of parallel computation Characteristics of SIMD models Design issue.
Communication operations Efficient Parallel Algorithms COMP308.
1 Lecture 13: Interconnection Networks Topics: flow control, router pipelines, case studies.
1 Tuesday, September 26, 2006 Wisdom consists of knowing when to avoid perfection. -Horowitz.
1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)
Models of Parallel Computation Advanced Algorithms & Data Structures Lecture Theme 12 Prof. Dr. Th. Ottmann Summer Semester 2006.
Examples Broadcasting and Gossiping. Broadcast on ring (Safe and Forward)
1 Lecture 25: Interconnection Networks Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E) Review session,
ECE669 L16: Interconnection Topology March 30, 2004 ECE 669 Parallel Computer Architecture Lecture 16 Interconnection Topology.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
Interconnect Network Topologies
Interconnection Networks. Applications of Interconnection Nets Interconnection networks are used everywhere! ◦ Supercomputers – connecting the processors.
1 Lecture 23: Interconnection Networks Topics: Router microarchitecture, topologies Final exam next Tuesday: same rules as the first midterm Next semester:
Computer Science Department
Interconnect Networks
On-Chip Networks and Testing
Spring EE 437 Lillevik 437s06-l2 University of Portland School of Engineering Advanced Computer Architecture Lecture 2 NSD with MUX and ROM Class.
Network Topologies Topology – how nodes are connected – where there is a wire between 2 nodes. Routing – the path a message takes to get from one node.
Spring EE 437 Lillevik 437s06-l8 University of Portland School of Engineering Advanced Computer Architecture Lecture 8 Project 3: memory agent Programmed.
PPC Spring Interconnection Networks1 CSCI-4320/6360: Parallel Programming & Computing (PPC) Interconnection Networks Prof. Chris Carothers Computer.
CSE Advanced Computer Architecture Week-11 April 1, 2004 engr.smu.edu/~rewini/8383.
Computer Architecture Lecture10: Input/output devices Piotr Bilski.
Computer Architecture Distributed Memory MIMD Architectures Ola Flygt Växjö University
CHAPTER 12 INTRODUCTION TO PARALLEL PROCESSING CS 147 Guy Wong page
Spring EE 437 Lillevik 437s06-l24 University of Portland School of Engineering Advanced Computer Architecture Lecture 24 Eight-node distributed.
Anshul Kumar, CSE IITD CSL718 : Multiprocessors Interconnection Mechanisms Performance Models 20 th April, 2006.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 January Session 4.
CSE 661 PAPER PRESENTATION
Spring EE 437 Lillevik 437s06-l9 University of Portland School of Engineering Advanced Computer Architecture Lecture 9 DMA controller design.
Anshul Kumar, CSE IITD ECE729 : Advanced Computer Architecture Lecture 27, 28: Interconnection Mechanisms In Multiprocessors 29 th, 31 st March, 2010.
Fall EE 333 Lillevik 333f06-l23 University of Portland School of Engineering Computer Organization Lecture 23 RAID Input/output design RS232 serial.
Interconnect Networks Basics. Generic parallel/distributed system architecture On-chip interconnects (manycore processor) Off-chip interconnects (clusters.
Super computers Parallel Processing
Spring EE 437 Lillevik 437s06-l5 University of Portland School of Engineering Advanced Computer Architecture Lecture 5 Slave bus agent ROM example.
HYPERCUBE ALGORITHMS-1
1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix F)
Spring EE 437 Lillevik 437s06-l22 University of Portland School of Engineering Advanced Computer Architecture Lecture 22 Distributed computer Interconnection.
Effective bandwidth with link pipelining Pipeline the flight and transmission of packets over the links Overlap the sending overhead with the transport.
Interconnection Networks Communications Among Processors.
1 Lecture 22: Interconnection Networks Topics: Routing, deadlock, flow control, virtual channels.
COMP8330/7330/7336 Advanced Parallel and Distributed Computing Communication Costs in Parallel Machines Dr. Xiao Qin Auburn University
Spring EE 437 Lillevik 437s06-l4 University of Portland School of Engineering Advanced Computer Architecture Lecture 4 Project 1 reviews CPU controller.
Interconnection structures
Overview Parallel Processing Pipelining
Parallel Architecture
Interconnect Networks
Auburn University COMP8330/7330/7336 Advanced Parallel and Distributed Computing Interconnection Networks (Part 2) Dr.
Advanced Computer Networks
Dynamic connection system
Lecture 23: Interconnection Networks
Interconnection topologies
Overview Parallel Processing Pipelining
Input/Output Organization contd:
Architecture of Parallel Computers CSC / ECE 506 Summer 2006 Scalable Programming Models Lecture 11 6/19/2006 Dr Steve Hunter.
Lecture 14: Interconnection Networks
Interconnection Network Design Lecture 14
Communication operations
Lecture: Interconnection Networks
High Performance Computing & Bioinformatics Part 2 Dr. Imad Mahgoub
Embedded Computer Architecture 5SAI0 Interconnection Networks
Lecture: Networks Topics: TM wrap-up, networks.
Lecture: Interconnection Networks
Lecture 25: Interconnection Networks
Advanced Computer Architecture Lecture 11
Advanced Computer Architecture Lecture 10
William Stallings Computer Organization and Architecture
Advanced Computer Architecture Lecture 3
Presentation transcript:

Advanced Computer Architecture Lecture 23 Tree and hypercube interconnects Routers Lillevik 437s06-l23 University of Portland School of Engineering

No global or shared memory Distributed computer Interconnect P M ... No global or shared memory Lillevik 437s06-l23 University of Portland School of Engineering

Trees may have k nodes-per-branch Binary tree Binary tree: re-drawn Trees may have k nodes-per-branch Lillevik 437s06-l23 University of Portland School of Engineering

Find the following? Diameter: 2log2n Average distance: log2n Binary tree, n nodes Diameter: 2log2n Average distance: log2n Bisection BW: 1 Lillevik 437s06-l23 University of Portland School of Engineering

Cables problematic for large D Hypercube 4-D 2-D 0-D 1-D 3-D 5-D Cables problematic for large D Lillevik 437s06-l23 University of Portland School of Engineering

Hypercube, n nodes (n = 2D) Find the following? Hypercube, n nodes (n = 2D) Diameter: log2 n Average distance: log2 n Bisection BW: Lillevik 437s06-l23 University of Portland School of Engineering

Routing algorithms Route: path a message must traverse Node ID = (x, y, z, …) Algorithm Route x dimension, then y, etc.  in order Avoids deadlock, maximum utilization Lillevik 437s06-l23 University of Portland School of Engineering

Node (1,0) sends message to node (2,3) Mesh routing example (0,0) (3,0) (3,3) (0,3) Node (1,0) sends message to node (2,3) (1,0)  (2,0)  (2,1)  (2,2)  (2,3) x - dim y - dim Lillevik 437s06-l23 University of Portland School of Engineering

Node (1,0,0) sends message to node (0,1,1) Find routing path? (0,0,0) (1,0,0) (1,1,0) (0,1,1) (1,1,1) (0,0,1) Node (1,0,0) sends message to node (0,1,1) Lillevik 437s06-l23 University of Portland School of Engineering

Nodes connected by links Processor and Router link Node Processor Router Links Simple bus Protocol Lillevik 437s06-l23 University of Portland School of Engineering

Router connects processor to links Router interfaces Router  Processor Interface Link Interfaces Router connects processor to links Lillevik 437s06-l23 University of Portland School of Engineering

Processor interface signals? A, D, C buses Ack, clk, reset Breq, BGnt Ben Lillevik 437s06-l23 University of Portland School of Engineering

Link interface signals? Send, receive IRQ, INTA Ready Lillevik 437s06-l23 University of Portland School of Engineering

Unidirectional ring router Processor Ring router contains three ports Lillevik 437s06-l23 University of Portland School of Engineering

Unidirectional ring router signals IReq IAck In OReq OAck Out RReq WReq RAck WAck D Link input Link output Processor Lillevik 437s06-l23 University of Portland School of Engineering

Mesh router contains five ports North Router West East South Processor Mesh router contains five ports Lillevik 437s06-l23 University of Portland School of Engineering

Mesh router signals? ERReq, ERAck, ….. Lillevik 437s06-l23 University of Portland School of Engineering

Ring router block diagram In I/F Out I/F CPU I/F Latch Controller Driver Lillevik 437s06-l23 University of Portland School of Engineering

Ring router schematic Lillevik 437s06-l23 University of Portland School of Engineering

Ring router modes Pass Write: CPU writing to router (source) Message passing through router, independent of local CPU activity Source an upstream CPU, destination a downstream CPU Write: CPU writing to router (source) Read: CPU reading from router (destination) DMA Lillevik 437s06-l23 University of Portland School of Engineering

Interference Routers support multiple modes (pass, read, write, broadcast, etc.) Some modes independent and support concurrency (parallel) Some modes are exclusive (dependent) Requires arbitration to resolve Results in message blocking and network interference Lillevik 437s06-l23 University of Portland School of Engineering

Pass mode data flow Latch In Out In I/F Controller Out I/F CPU I/F Driver Lillevik 437s06-l23 University of Portland School of Engineering

Write mode data flow? Latch In Out In I/F Controller Out I/F CPU I/F Driver Lillevik 437s06-l23 University of Portland School of Engineering

Read mode data flow? Latch In Out In I/F Controller Out I/F CPU I/F Driver Lillevik 437s06-l23 University of Portland School of Engineering

Message format Header: routing and control information Payload: data Trailer: error checking code (ECC) time Trailer Payload Header Lillevik 437s06-l23 University of Portland School of Engineering

Eight-node example 4 6 1 3 7 5 2 Write Pass Read Lillevik 437s06-l23 4 6 1 3 7 5 2 Write Pass Read Lillevik 437s06-l23 University of Portland School of Engineering

Lillevik 437s06-l23 University of Portland School of Engineering

Find the following? Diameter: 2 log2 n Average distance: log2 n Binary tree, n nodes Diameter: 2 log2 n Average distance: log2 n Bisection BW: 1 Lillevik 437s06-l23 University of Portland School of Engineering

Hypercube, n nodes (n = 2D) Find the following? Hypercube, n nodes (n = 2D) Diameter: log2 n Average distance: 1/2 log2 n Bisection BW: Lillevik 437s06-l23 University of Portland School of Engineering

Node (1,0,0) sends message to node (0,1,1) Find routing path? (0,0,0) (1,0,0) (1,1,0) (0,1,1) (1,1,1) (0,0,1) Node (1,0,0) sends message to node (0,1,1) (1,0,0)  (0,0,0)  (0,1,0)  (0,1,1) Lillevik 437s06-l23 University of Portland School of Engineering

Processor interface signals? Processor output request Processor output acknowledge Processor input request Processor input acknowledge Lillevik 437s06-l23 University of Portland School of Engineering

Link interface signals? Link output request Link output acknowledge Link input request Link input acknowledge Lillevik 437s06-l23 University of Portland School of Engineering

Mesh router signals? PIReq, PIAck, POReq, POAck, PData NIReq, NIAck, NOReq, NOAck, NData EIReq, EIAck, EOReq, EOAck, EData SIReq, SIAck, SOReq, SOAck, SData WIReq, WIAck, WOReq, WOAck, WData Lillevik 437s06-l23 University of Portland School of Engineering

Write mode data flow? Latch In Out In I/F Controller Out I/F CPU I/F Driver Lillevik 437s06-l23 University of Portland School of Engineering

Read mode data flow? Latch In Out In I/F Controller Out I/F CPU I/F Driver Lillevik 437s06-l23 University of Portland School of Engineering