Refer example 2.4on page 64 ACA(Kai Hwang) And refer another ppt attached for static scheduling example.

Slides:



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

Super computers Parallel Processing By: Lecturer \ Aisha Dawood.
CSCI 8150 Advanced Computer Architecture Hwang, Chapter 2 Program and Network Properties 2.4 System Interconnect Architectures.
1 Lecture 23: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Appendix E)
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.
NUMA Mult. CSE 471 Aut 011 Interconnection Networks for Multiprocessors Buses have limitations for scalability: –Physical (number of devices that can be.
7. Fault Tolerance Through Dynamic or Standby Redundancy 7.6 Reconfiguration in Multiprocessors Focused on permanent and transient faults detection. Three.
1 Lecture 24: Interconnection Networks Topics: communication latency, centralized and decentralized switches (Sections 8.1 – 8.5)
CSCI 8150 Advanced Computer Architecture Hwang, Chapter 7 Multiprocessors and Multicomputers 7.1 Multiprocessor System Interconnects.
1 Lecture 25: Interconnection Networks Topics: communication latency, centralized and decentralized switches, routing, deadlocks (Appendix E) Review session,
8.1 Chapter 8 Switching Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Interconnection Networks in Multiprocessor Systems By: Wallun Chan Course: CS 147 Text: Chapter 12, p Professor: Sin-Min Lee.
Chapter 5 Array Processors. Introduction  Major characteristics of SIMD architectures –A single processor(CP) –Synchronous array processors(PEs) –Data-parallel.
Interconnection Networks. Applications of Interconnection Nets Interconnection networks are used everywhere! ◦ Supercomputers – connecting the processors.
8.1 Chapter 8 Switching Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
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.
Multiprocessor systems Objective n the multiprocessors’ organization and implementation n the shared-memory in multiprocessor n static and dynamic connection.
Dynamic Interconnect Lecture 5. COEN Multistage Network--Omega Network Motivation: simulate crossbar network but with fewer links Components: –N.
Parallel Computer Architecture and Interconnect 1b.1.
CHAPTER 12 INTRODUCTION TO PARALLEL PROCESSING CS 147 Guy Wong page
1 Dynamic Interconnection Networks Miodrag Bolic.
CSCI 232© 2005 JW Ryder1 Parallel Processing Large class of techniques used to provide simultaneous data processing tasks Purpose: Increase computational.
Switches and indirect networks Computer Architecture AMANO, Hideharu Textbook pp. 92~13 0.
Lecture 3 Innerconnection Networks for Parallel Computers
شبکه های میان ارتباطی 1 به نام خدا دکتر محمد کاظم اکبری مرتضی سرگلزایی جوان
Anshul Kumar, CSE IITD CSL718 : Multiprocessors Interconnection Mechanisms Performance Models 20 th April, 2006.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture.
Shanghai Jiao Tong University 2012 Indirect Networks or Dynamic Networks Guihai Chen …with major presentation contribution from José Flich, UPV (and Cell.
Anshul Kumar, CSE IITD ECE729 : Advanced Computer Architecture Lecture 27, 28: Interconnection Mechanisms In Multiprocessors 29 th, 31 st March, 2010.
Birds Eye View of Interconnection Networks
1 Interconnection Networks. 2 Interconnection Networks Interconnection Network (for SIMD/MIMD) can be used for internal connections among: Processors,
Interconnect Networks Basics. Generic parallel/distributed system architecture On-chip interconnects (manycore processor) Off-chip interconnects (clusters.
Super computers Parallel Processing
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 10.
Univ. of TehranIntroduction to Computer Network1 An Introduction to Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
COMP8330/7330/7336 Advanced Parallel and Distributed Computing Tree-Based Networks Cache Coherence Dr. Xiao Qin Auburn University
Interconnection Networks Communications Among Processors.
INTERCONNECTION NETWORK
Network Connected Multiprocessors
Multiprocessor System Distributed System
Interconnection structures
Overview Parallel Processing Pipelining
Parallel Architecture
Interconnect Networks
Network Resources.
Auburn University COMP8330/7330/7336 Advanced Parallel and Distributed Computing Interconnection Networks (Part 2) Dr.
Dynamic connection system
Lecture 23: Interconnection Networks
URL: Chapter 8 Switching Tel: (03) Ext: URL:
Overview Parallel Processing Pipelining
Chapter 3 Switching.
Parallel and Multiprocessor Architectures
Multiprocessors Interconnection Networks
Subject Name: Digital Switching Systems Subject Code:10EC82 Prepared By: Aparna.P, Farha Kowser Department: Electronics and Communication Date:
INTERCONNECTION NETWORKS
Indirect Networks or Dynamic Networks
Mesh-Connected Illiac Networks
High Performance Computing & Bioinformatics Part 2 Dr. Imad Mahgoub
Advanced Computer and Parallel Processing
Interconnection Networks Contd.
Multiprocessors Interconnection Networks
Dynamic Interconnection Networks
CS 6290 Many-core & Interconnect
Birds Eye View of Interconnection Networks
Advanced Computer and Parallel Processing
Design Principles of Scalable Switching Networks
Multiprocessors and Multi-computers
Multiprocessor System Interconnects
Presentation transcript:

Refer example 2.4on page 64 ACA(Kai Hwang) And refer another ppt attached for static scheduling example.

Bisection width b = minimum number of edges cut to split a network into two parts each having the same number of nodes.

Factors Affecting Network Performance Functionality – how the network supports data routing, interrupt handling, synchronization, request/message combining, and coherence Network latency – worst-case time for a unit message to be transferred Bandwidth – maximum data rate Hardware complexity – implementation costs for wire, logic, switches, connectors, etc. Scalability – how easily does the scheme adapt to an increasing number of processors,memories, etc

A fat tree network of 16 processing nodes.

Different classes of Multistage Interconnection Networks(MINs) differ in switch module and in the kind of interstage pattern used. The patterns often include perfect shuffle,butterfly,crossbar,cube connection etc

Omega Network A 2  2 switch can be configured for Straight-through Crossover Upper broadcast (upper input to both outputs) Lower broadcast (lower input to both outputs) (No output is a somewhat vacuous possibility as well) With four stages of eight 2  2 switches, and a static perfect shuffle for each of the four ISCs, a 16 by 16 Omega network can be constructed (but not all permutations are possible). In general , an n-input Omega network requires log 2 n stages of 2  2 switches and n / 2 switch modules.

Patterns

16 x 16 omega network

Network Topologies: Multistage Omega Network A complete Omega network with the perfect shuffle interconnects and switches can now be illustrated: A complete omega network connecting eight inputs and eight outputs. An omega network has p/2 × log p switching nodes, and the cost of such a network grows as (p log p).

Network Topologies: Multistage Omega Network – Routing An example of blocking in omega network: one of the messages (010 to 111 or 110 to 100) is blocked at link AB.

Recursive Construction The first stage contains one NXN block and second stage contains 2 (N/2)x (N/2) sub blocks labeled Co and C1. This construction can be recursively repeated to bub block until 2x2 switch is reached.

7/19/2018 Baseline Network The figure to the right shows an 8 x 8 Baseline network. A C B D 1 2 3 4 5 6 7 A C B D J I E G To generalize into an n x n Baseline network, first create one stage of (n / 2) 2 x 2 switches. Then one output from each 2 x 2 switch is connected to an input of each (n / 2) x (n / 2) switch. K L H F Then the (n / 2) x (n / 2) switches are replaced by (n / 2) x (n / 2) Baseline networks constructed in the same way. The Baseline and Omega networks are isomorphic with each other.

Isomorphism Between Baseline and Omega Networks (cont.) 7/19/2018 Isomorphism Between Baseline and Omega Networks (cont.) Starting with the Baseline network. If B and C, and F and G are repositioned while keeping the fixed links as the switches are moved. A D 1 2 3 4 5 6 7 I E L H C B J K F G B C J F K G The Baseline network transforms into the Omega network. Therefore, the Baseline and Omega networks are isomorphic.

Crossbar Networks A crossbar network can be visualized as a single-stage switch network. Like a telephone switch board, the crosspoint switches provide dynamic connections between(source, destination) pairs. Each cross point switch can provide a dedicated connection path between a pair. The switch can be set on or off dynamically upon program demand.

Shared Memory Crossbar To build a shared-memory multiprocessor, one can use a crossbar network between the processors and memory modules (Fig. 2.26a). The C.mmp multiprocessor has implemented a 16 x 16 crossbar network which connects 16 PDP 11 processors to 16 memory modules, each of which has a capability of 1 million words of memory cells.

Shared Memory Crossbar Switch

Shared Memory Crossbar Switch Note that each memory module can satisfy only one processor request at a time. When multiple requests arrive at the same memory module simaltaneously,cross bar must resolve the conflicts.

Interprocess Communication Crossbar Switch This large crossbar was actually built in vector parallel processor. The PEs are the processor with attached memory. The CPs stand for control processor which are used to supervise entire system operation.

Interprocess Communication Crossbar Switch

End Of Module 5