buses, crossing switch, multistage network.

Slides:



Advertisements
Similar presentations
PIPELINE AND VECTOR PROCESSING
Advertisements

Prepared 7/28/2011 by T. O’Neil for 3460:677, Fall 2011, The University of Akron.
Lecture 38: Chapter 7: Multiprocessors Today’s topic –Vector processors –GPUs –An example 1.
Today’s topics Single processors and the Memory Hierarchy
Taxanomy of parallel machines. Taxonomy of parallel machines Memory – Shared mem. – Distributed mem. Control – SIMD – MIMD.
Tuesday, September 12, 2006 Nothing is impossible for people who don't have to do it themselves. - Weiler.
Multiprocessors ELEC 6200: Computer Architecture and Design Instructor : Agrawal Name: Nam.

Arquitectura de Sistemas Paralelos e Distribuídos Paulo Marques Dep. Eng. Informática – Universidade de Coimbra Ago/ Machine.
PSU CS 106 Computing Fundamentals II Introduction HM 1/3/2009.
1 Computer Science, University of Warwick Architecture Classifications A taxonomy of parallel architectures: in 1972, Flynn categorised HPC architectures.
Introduction to Parallel Processing Ch. 12, Pg
Flynn’s Taxonomy of Computer Architectures Source: Wikipedia Michael Flynn 1966 CMPS 5433 – Parallel Processing.
Introduction to Parallel Processing 3.1 Basic concepts 3.2 Types and levels of parallelism 3.3 Classification of parallel architecture 3.4 Basic parallel.
Computer Architecture Parallel Processing
Parallel Computing Basic Concepts Computational Models Synchronous vs. Asynchronous The Flynn Taxonomy Shared versus Distributed Memory Interconnection.
CS668- Lecture 2 - Sept. 30 Today’s topics Parallel Architectures (Chapter 2) Memory Hierarchy Busses and Switched Networks Interconnection Network Topologies.
1 Chapter 1 Parallel Machines and Computations (Fundamentals of Parallel Processing) Dr. Ranette Halverson.
Introduction, background, jargon Jakub Yaghob. Literature T.G.Mattson, B.A.Sanders, B.L.Massingill: Patterns for Parallel Programming, Addison- Wesley,
Parallel Processing - introduction  Traditionally, the computer has been viewed as a sequential machine. This view of the computer has never been entirely.
CHAPTER 12 INTRODUCTION TO PARALLEL PROCESSING CS 147 Guy Wong page
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Parallel Programming in C with MPI and OpenMP Michael J. Quinn.
Multiprocessing. Going Multi-core Helps Energy Efficiency William Holt, HOT Chips 2005 Adapted from UC Berkeley "The Beauty and Joy of Computing"
General Concepts of Computer Organization Overview of Microcomputer.
Orange Coast College Business Division Computer Science Department CS 116- Computer Architecture Multiprocessors.
Parallel Computing.
Pipelining and Parallelism Mark Staveley
1 Basic Components of a Parallel (or Serial) Computer CPU MEM CPU MEM CPU MEM CPU MEM CPU MEM CPU MEM CPU MEM CPU MEM CPU MEM.
Outline Why this subject? What is High Performance Computing?
Computer Architecture And Organization UNIT-II Flynn’s Classification Of Computer Architectures.
Lecture 3: Computer Architectures
Parallel Processing Presented by: Wanki Ho CS147, Section 1.
3/12/2013Computer Engg, IIT(BHU)1 INTRODUCTION-1.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 May 2, 2006 Session 29.
An Overview of Parallel Processing
Parallel Computing Presented by Justin Reschke
LECTURE #1 INTRODUCTON TO PARALLEL COMPUTING. 1.What is parallel computing? 2.Why we need parallel computing? 3.Why parallel computing is more difficult?
Classification of parallel computers Limitations of parallel processing.
Lecture 13 Parallel Processing. 2 What is Parallel Computing? Traditionally software has been written for serial computation. Parallel computing is the.
Processor Level Parallelism 1
These slides are based on the book:
Auburn University COMP8330/7330/7336 Advanced Parallel and Distributed Computing Parallel Hardware Dr. Xiao Qin Auburn.
COMP 740: Computer Architecture and Implementation
Flynn’s Taxonomy Many attempts have been made to come up with a way to categorize computer architectures. Flynn’s Taxonomy has been the most enduring of.
Overview Parallel Processing Pipelining
CHAPTER SEVEN PARALLEL PROCESSING © Prepared By: Razif Razali.
18-447: Computer Architecture Lecture 30B: Multiprocessors
Higher Level Parallelism
Distributed Processors
Parallel computer architecture classification
buses, crossing switch, multistage network.
Parallel Processing - introduction
CS 147 – Parallel Processing
Flynn’s Classification Of Computer Architectures
Array Processor.
Parallel Architectures Based on Parallel Computing, M. J. Quinn
Chapter 17 Parallel Processing
Symmetric Multiprocessing (SMP)
Computer Organization
Overview Parallel Processing Pipelining
Chap. 9 Pipeline and Vector Processing
Mattan Erez The University of Texas at Austin
AN INTRODUCTION ON PARALLEL PROCESSING
Advanced Computer and Parallel Processing
Part 2: Parallel Models (I)
Mattan Erez The University of Texas at Austin
Chapter 4 Multiprocessors
COMPUTER ARCHITECTURES FOR PARALLEL ROCESSING
Advanced Computer and Parallel Processing
Advanced Topic: Alternative Architectures Chapter 9 Objectives
Presentation transcript:

buses, crossing switch, multistage network. University of Technology Computer engineering and information technology Department Distributed system : Forms parallelism. Classification architecture : Flynn Taxonomy: SISD,SIMD,MISD and MIMD. According connection memory - processor : Share memory: -according access UMA,NUMA,COMA. -according connection: buses, crossing switch, multistage network. Message system: -according network topology. Hybrid system (combination access). Distributed share memory.

Form Parallelism 1 Processors: University of Technology Computer engineering and information technology Department Form Parallelism 1 Processors: -sequence :execute always only one instruction. -”look ahead”: looking also to next instruction. Overlapping phase read and decode with executing instruction. Function parallelism: Multi function units. Chining-”pipeline”.

Multi function units. Chining-”pipeline”.

Form Parallelism 2 Chining (Next parts function units). University of Technology Computer engineering and information technology Department Form Parallelism 2 Chining (Next parts function units). Implicit processing vector operand. Explicit vector operand. Register –register. - Single Instruction Multiple Data “SIMD” : ex: processor array “EPIC” Very Long Instruction Word ”VLIW”.

Form parallelism 3 Memory – memory. University of Technology Computer engineering and information technology Department Form parallelism 3 Memory – memory. - Multiple Instruction Multiple Data “MIMD” : ex: Multiprocessor, Multicomputer.

Flynn Taxonomy Michael J. Flynn (1966). University of Technology Computer engineering and information technology Department Flynn Taxonomy Michael J. Flynn (1966). How much instruction in given moment running and over how much data elements. Instruction Stream Single Multiple Data Stream SISD MISD SIMD MIMD

SISD One control unit ,one flow control. University of Technology Computer engineering and information technology Department SISD One control unit ,one flow control. From memory read/write always only one value data. Classical von Neumann architecture. Input unit processor control Memory output unit

Today architecture of SISD University of Technology Computer engineering and information technology Department Today architecture of SISD CPU North bridge (memory controller) AGP RAM System clock PCI south bridge (I/O controller) I/O

SIMD University of Technology Computer engineering and information technology Department SIMD

University of Technology Computer engineering and information technology Department SIMD Single control unit (single instruction cache) control multi equal (synchronize) executed units. Equal operation will execute with various data. Vector processors: operate over vector execute in single instruction cycle. (increment over component scalar multiply ). Work with special HW “ VLIW, EPIC”. Note: VLIW (Very Long Instruction Word). EPIC( Explicitly Parallel Instruction Computing).

Characteristic : Count execution units (EU). Count scalar instruction. University of Technology Computer engineering and information technology Department Characteristic : Count execution units (EU). Count scalar instruction. Semaphore. Count bridge scheme. Count vector instruction.

MISD Multiple Various operation over equal data : University of Technology Computer engineering and information technology Department MISD Multiple Various operation over equal data : -Data pass at once to all execution units (different parts single data flow ). -Data pass to first execution unit and his output is input to next …”Micro- pipeline”. Ex: Carnegie-Mellon, Multi mini processor ”C.mmp” (16p,SIMD,MISD,MIMD) “Data flow” architecture, systolic array. Only for integrity, Practically unused.

MIMD University of Technology Computer engineering and information technology Department MIMD

University of Technology Computer engineering and information technology Department MIMD Multi flow “control and data” _ each processor can execute different program on itself data. Can work asynchronous (on different from MISD). Processors synchronous for access to share (resources) data. Computer with multi processor (SM-MIMD). Multi computer connected in network (DM-MIMD).

How can seem MIMD/SIMD? Multiprocessors: University of Technology Computer engineering and information technology Department How can seem MIMD/SIMD? Multiprocessors: -Narrow band- communicate through share memory. -Single (share) address space. - Assigned data getting by searching program on share memory locations. -Semaphore, mutex, barrier. Multicomputer: -Free band-communication message system. -Each process have self memory and address space. -Located assigned data by effected step (instruction)in program.