Examples Broadcasting and Gossiping. Broadcast on ring (Safe and Forward)

Slides:

Advertisements

Similar presentations

Comparison Of Network On Chip Topologies Ahmet Salih BÜYÜKKAYHAN Fall.

Advertisements

Parallel Processing1 Parallel Processing (CS 667) Lecture 9: Advanced Point to Point Communication Jeremy R. Johnson *Parts of this lecture was derived.

CIS December '99 Introduction to Parallel Architectures Dr. Laurence Boxer Niagara University.

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.

Overview Efficient Parallel Algorithms COMP308. COMP 308 Exam Time allowed : 2.5 hours Answer four questions (out of six). If you attempt to answer more.

Interconnection Networks 1 Interconnection Networks (Chapter 6) References: [1,Wilkenson and Allyn, Ch. 1] [2, Akl, Chapter 2] [3, Quinn, Chapter 2-3]

1 CSE 591-S04 (lect 14) Interconnection Networks (notes by Ken Ryu of Arizona State) l Measure –How quickly it can deliver how much of what’s needed to.

Parallel Routing Bruce, Chiu-Wing Sham. Overview Background Routing in parallel computers Routing in hypercube network –Bit-fixing routing algorithm –Randomized.

ICN’s The n-D hypercube (n-cube) contains 2^n nodes (processors).

Communication operations Efficient Parallel Algorithms COMP308.

Broadcast and scatter algorithms on mesh- based topologies.

Wireless Networks Lab – A Simple Tree Network 2007/11/14 Chia-Hung Tsai.

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.

Interconnection Network Topologies

CS 584. Algorithm Analysis Assumptions n Consider ring, mesh, and hypercube. n Each process can either send or receive a single message at a time. n No.

Topic Overview One-to-All Broadcast and All-to-One Reduction

EECC756 - Shaaban #1 lec # 9 Spring Generic Multiprocessor Architecture Generic Multiprocessor Architecture Node: processor(s), memory system,

Course Outline Introduction in algorithms and applications Parallel machines and architectures Overview of parallel machines, trends in top-500 Cluster.

Design of parallel algorithms Matrix operations J. Porras.

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

1 Static Interconnection Networks CEG 4131 Computer Architecture III Miodrag Bolic.

Interconnect Network Topologies

Interconnection Networks. Applications of Interconnection Nets Interconnection networks are used everywhere! ◦ Supercomputers – connecting the processors.

Computer Science Department

Interconnect Networks

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.

Basic Communication Operations Based on Chapter 4 of Introduction to Parallel Computing by Ananth Grama, Anshul Gupta, George Karypis and Vipin Kumar These.

PPC Spring Interconnection Networks1 CSCI-4320/6360: Parallel Programming & Computing (PPC) Interconnection Networks Prof. Chris Carothers Computer.

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

COMP308 Efficient Parallel Algorithms

Dynamic Interconnect Lecture 5. COEN Multistage Network--Omega Network Motivation: simulate crossbar network but with fewer links Components: –N.

Topic Overview One-to-All Broadcast and All-to-One Reduction All-to-All Broadcast and Reduction All-Reduce and Prefix-Sum Operations Scatter and Gather.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programming in C with MPI and OpenMP Michael J. Quinn.

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.

OSI Model. Switches point to point bridges two types store & forward = entire frame received the decision made, and can handle frames with errors cut-through.

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

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Shared versus Switched Media.

Basic Communication Operations Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar Reduced slides for CSCE 3030 To accompany the text ``Introduction.

1 Interconnection Networks. 2 Interconnection Networks Interconnection Network (for SIMD/MIMD) can be used for internal connections among: Processors,

Introduction to Computer Networks Dr. Sanjay P. Ahuja, Ph.D FIS Distinguished Professor of Computer Science School of Computing, UNF.

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

Ch 8. Switching. Switch  Devices that interconnected with each other  Connecting all nodes (like mesh network) is not cost-effective  Some topology.

Super computers Parallel Processing

HYPERCUBE ALGORITHMS-1

Basic Communication Operations Carl Tropper Department of Computer Science.

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.

Computer Communication and Networking Lecture # 4 by Zainab Malik 1.

Copyright 2007 Koren & Krishna, Morgan-Kaufman Part.12.1 FAULT TOLERANT SYSTEMS Part 12 - Networks.

COMP8330/7330/7336 Advanced Parallel and Distributed Computing Tree-Based Networks Cache Coherence Dr. Xiao Qin Auburn University

Interconnection Networks Communications Among Processors.

Distributed-Memory or Graph Models

Networks Network:end-node and router C 2 B 1 3 D 5 A 4 6 E 7 Router F

Computer Network Topology

Lecture 23: Interconnection Networks

Connection System Serve on mutual connection processors and memory .

Interconnection topologies

Interconnection Network Design Lecture 14

Communication operations

Static Interconnection Networks

High Performance Computing & Bioinformatics Part 2 Dr. Imad Mahgoub

Static Interconnection Networks

Topology What are the consequences of using fewer than n2 connections?

Introduction Johan Lukkien

Presentation transcript:

Examples Broadcasting and Gossiping

Broadcast on ring (Safe and Forward)

Broadcast on mesh (Safe and Forward)

Hypercube Important properties of the networks: –Small degree, –Small diameter, –Regular recursive structure, –Easy way to embed trees, etc Hypercube – two nodes connected if they are differ precisely on one bit

Broadcast on hypercube (S&F)

Broadcast on ring (Cut-Through )

Broadcast on mesh (C-T)

Broadcast on binary tree (C-T)

Gossiping All-to-All Communication

Gossiping on Ring (Store and Forward)

Gossiping on Mesh (Store and Forward)

Gossiping on Hypercube (S&F)

Gossiping on Ring (and Mesh) Cut-Through Routing Each process sends m(p-1) words of data because it has an m- word packet for every other processor The average distance that an m word packet travels is Since there are p processors, each performing the same type of communication, the total traffic on the network is The total number of communication channels in the network to share this load is p. Hence this procedure cannot be improved by using CT routing

Gossiping on Hypercube (CT routing)