Organisasi Sistem Komputer

Similar documents
Computer Organization. Chapter 16

Chapter 18 Parallel Processing

CSCI 4717 Computer Architecture

Chapter 18. Parallel Processing. Yonsei University

Parallel Processing. Computer Architecture. Computer Architecture. Outline. Multiple Processor Organization

10 Parallel Organizations: Multiprocessor / Multicore / Multicomputer Systems

Lecture 9: MIMD Architectures

Lecture 9: MIMD Architectures

Non-uniform memory access machine or (NUMA) is a system where the memory access time to any region of memory is not the same for all processors.

Comp. Org II, Spring

Parallel Processing & Multicore computers

Comp. Org II, Spring

Multi-Processor / Parallel Processing

Lecture 9: MIMD Architecture

Chapter 17 - Parallel Processing

Computer parallelism Flynn s categories

Multiprocessors & Thread Level Parallelism

Module 5 Introduction to Parallel Processing Systems

Memory Systems in Pipelined Processors

Computer Systems Architecture

06-Dec-17. Credits:4. Notes by Pritee Parwekar,ANITS 06-Dec-17 1

Lecture 24: Virtual Memory, Multiprocessors

Chap. 4 Multiprocessors and Thread-Level Parallelism

Computer Systems Architecture

SMD149 - Operating Systems - Multiprocessing

Overview. SMD149 - Operating Systems - Multiprocessing. Multiprocessing architecture. Introduction SISD. Flynn s taxonomy

MULTIPROCESSORS AND THREAD-LEVEL. B649 Parallel Architectures and Programming

MULTIPROCESSORS AND THREAD-LEVEL PARALLELISM. B649 Parallel Architectures and Programming

Chapter Seven. Idea: create powerful computers by connecting many smaller ones

Multiple Issue and Static Scheduling. Multiple Issue. MSc Informatics Eng. Beyond Instruction-Level Parallelism

Computer and Information Sciences College / Computer Science Department CS 207 D. Computer Architecture. Lecture 9: Multiprocessors

INSTITUTO SUPERIOR TÉCNICO. Architectures for Embedded Computing

Characteristics of Mult l ip i ro r ce c ssors r

Multiprocessors and Thread-Level Parallelism. Department of Electrical & Electronics Engineering, Amrita School of Engineering

Parallel Computer Architectures. Lectured by: Phạm Trần Vũ Prepared by: Thoại Nam

Computer Architecture

Non-Uniform Memory Access (NUMA) Architecture and Multicomputers

COSC 6385 Computer Architecture - Multi Processor Systems

Lecture 8: RISC & Parallel Computers. Parallel computers

Non-Uniform Memory Access (NUMA) Architecture and Multicomputers

Handout 3 Multiprocessor and thread level parallelism

Multiprocessors - Flynn s Taxonomy (1966)

Multiprocessors 1. Outline

3/24/2014 BIT 325 PARALLEL PROCESSING ASSESSMENT. Lecture Notes:

Introduction to Parallel Processing

Introduction. Distributed Systems. Introduction. Introduction. Instructor Brian Mitchell - Brian

Non-Uniform Memory Access (NUMA) Architecture and Multicomputers

Lecture 7: Parallel Processing

FLYNN S TAXONOMY OF COMPUTER ARCHITECTURE

ARCHITECTURAL CLASSIFICATION. Mariam A. Salih

Lecture 7: Parallel Processing

Parallel Computing Platforms. Jinkyu Jeong Computer Systems Laboratory Sungkyunkwan University

Lecture 24: Memory, VM, Multiproc

Chapter 11. Introduction to Multiprocessors

Issues in Multiprocessors

Lecture Topics. Announcements. Today: Advanced Scheduling (Stallings, chapter ) Next: Deadlock (Stallings, chapter

Advanced Parallel Architecture. Annalisa Massini /2017

Lecture 30: Multiprocessors Flynn Categories, Large vs. Small Scale, Cache Coherency Professor Randy H. Katz Computer Science 252 Spring 1996

Parallel Processors. The dream of computer architects since 1950s: replicate processors to add performance vs. design a faster processor

Flynn s Classification

CMPE 511 TERM PAPER. Distributed Shared Memory Architecture. Seda Demirağ

Portland State University ECE 588/688. Cache Coherence Protocols

Parallel Computing Platforms

Issues in Multiprocessors

Parallel Architectures

Processor Architecture and Interconnect

Parallel Computers. CPE 631 Session 20: Multiprocessors. Flynn s Tahonomy (1972) Why Multiprocessors?

Normal computer 1 CPU & 1 memory The problem of Von Neumann Bottleneck: Slow processing because the CPU faster than memory

Multiprocessing and Scalability. A.R. Hurson Computer Science and Engineering The Pennsylvania State University

Chapter 8. Multiprocessors. In-Cheol Park Dept. of EE, KAIST

Multiprocessor Cache Coherence. Chapter 5. Memory System is Coherent If... From ILP to TLP. Enforcing Cache Coherence. Multiprocessor Types

1. Memory technology & Hierarchy

EITF20: Computer Architecture Part 5.2.1: IO and MultiProcessor

Parallel Computer Architecture Spring Shared Memory Multiprocessors Memory Coherence

Mul$processor Architecture. CS 5334/4390 Spring 2014 Shirley Moore, Instructor February 4, 2014

Distributed Systems. Thoai Nam Faculty of Computer Science and Engineering HCMC University of Technology

Multiprocessors. Flynn Taxonomy. Classifying Multiprocessors. why would you want a multiprocessor? more is better? Cache Cache Cache.

Distributed Operating System Shilpa Yadav; Tanushree & Yashika Arora

Chapter 9 Multiprocessors

Operating System 4 THREADS, SMP AND MICROKERNELS

Chapter 5. Multiprocessors and Thread-Level Parallelism

Parallel Architecture. Hwansoo Han

Computer-System Organization (cont.)

DISTRIBUTED COMPUTING

Online Course Evaluation. What we will do in the last week?

Page 1. SMP Review. Multiprocessors. Bus Based Coherence. Bus Based Coherence. Characteristics. Cache coherence. Cache coherence

Top500 Supercomputer list

Chapter 5 Thread-Level Parallelism. Abdullah Muzahid

Architecture of parallel processing in computer organization

Intro to Multiprocessors

Parallel Architectures

Parallel Computing Introduction

18-447: Computer Architecture Lecture 30B: Multiprocessors. Prof. Onur Mutlu Carnegie Mellon University Spring 2013, 4/22/2013

Multicores, Multiprocessors, and Clusters

Chapter-4 Multiprocessors and Thread-Level Parallelism

A Multiprocessor system generally means that more than one instruction stream is being executed in parallel.

Computer Architecture Lecture 27: Multiprocessors. Prof. Onur Mutlu Carnegie Mellon University Spring 2015, 4/6/2015

Shared Symmetric Memory Systems

Chapter 8 : Multiprocessors

Introduction to Parallel Programming

Transcription:

LOGO Organisasi Sistem Komputer OSK 14 Parallel Processing Pendidikan Teknik Elektronika FT UNY

Multiple Processor Organization Single instruction, single data stream - SISD Single instruction, multiple data stream - SIMD Multiple instruction, single data stream - MISD Multiple instruction, multiple data stream- MIMD

Single Instruction, Single Data Stream - SISD Single processor Single instruction stream Data stored in single memory Uni-processor

Single Instruction, Multiple Data Stream - SIMD Single machine instruction Controls simultaneous execution Number of processing elements Lockstep basis Each processing element has associated data memory Each instruction executed on different set of data by different processors Vector and array processors

Multiple Instruction, Single Data Stream - MISD Sequence of data Transmitted to set of processors Each processor executes different instruction sequence Never been implemented

Multiple Instruction, Multiple Data Stream- MIMD Set of processors Simultaneously execute different instruction sequences Different sets of data SMPs, clusters and NUMA systems

Taxonomy of Parallel Processor Architectures

MIMD - Overview General purpose processors Each can process all instructions necessary Further classified by method of processor communication

Tightly Coupled - SMP Processors share memory Communicate via that shared memory Symmetric Multiprocessor (SMP) Share single memory or pool Shared bus to access memory Memory access time to given area of memory is approximately the same for each processor

Tightly Coupled - NUMA Nonuniform memory access Access times to different regions of memroy may differ

Loosely Coupled - Clusters Collection of independent uniprocessors or SMPs Interconnected to form a cluster Communication via fixed path or network connections

Parallel Organizations - SISD

Parallel Organizations - SIMD

Parallel Organizations - MIMD Shared Memory

Parallel Organizations - MIMD Distributed Memory

Symmetric Multiprocessors A stand alone computer with the following characteristics Two or more similar processors of comparable capacity Processors share same memory and I/O Processors are connected by a bus or other internal connection Memory access time is approximately the same for each processor All processors share access to I/O Either through same channels or different channels giving paths to same devices All processors can perform the same functions (hence symmetric) System controlled by integrated operating system providing interaction between processors Interaction at job, task, file and data element levels

SMP Advantages Performance If some work can be done in parallel Availability Since all processors can perform the same functions, failure of a single processor does not halt the system Incremental growth User can enhance performance by adding additional processors Scaling Vendors can offer range of products based on number of processors

Block Diagram of Tightly Coupled Multiprocessor

Organization Classification Time shared or common bus Multiport memory Central control unit

Time Shared Bus Simplest form Structure and interface similar to single processor system Following features provided Addressing - distinguish modules on bus Arbitration - any module can be temporary master Time sharing - if one module has the bus, others must wait and may have to suspend Now have multiple processors as well as multiple I/O modules

Time Share Bus - Advantages Simplicity Flexibility Reliability

Time Share Bus - Disadvantage Performance limited by bus cycle time Each processor should have local cache Reduce number of bus accesses Leads to problems with cache coherence Solved in hardware - see later

Multiport Memory Direct independent access of memory modules by each processor Logic required to resolve conflicts Little or no modification to processors or modules required

Multiport Memory - Advantages and Disadvantages More complex Extra login in memory system Better performance Each processor has dedicated path to each module Can configure portions of memory as private to one or more processors Increased security Write through cache policy

Central Control Unit Funnels separate data streams between independent modules Can buffer requests Performs arbitration and timing Pass status and control Perform cache update alerting Interfaces to modules remain the same e.g. IBM S/370

Operating System Issues Simultaneous concurrent processes Scheduling Synchronization Memory management Reliability and fault tolerance

IBM S/390 Mainframe SMP

S/390 - Key components Processor unit (PU) CISC microprocessor Frequently used instructions hard wired 64k L1 unified cache with 1 cycle access time L2 cache 384k Bus switching network adapter (BSN) Includes 2M of L3 cache Memory card 8G per card

Cache Coherence and MESI Protocol Problem - multiple copies of same data in different caches Can result in an inconsistent view of memory Write back policy can lead to inconsistency Write through can also give problems unless caches monitor memory traffic

Software Solutions Compiler and operating system deal with problem Overhead transferred to compile time Design complexity transferred from hardware to software However, software tends to make conservative decisions Inefficient cache utilization Analyze code to determine safe periods for caching shared variables

Hardware Solution Cache coherence protocols Dynamic recognition of potential problems Run time More efficient use of cache Transparent to programmer Directory protocols Snoopy protocols

Directory Protocols Collect and maintain information about copies of data in cache Directory stored in main memory Requests are checked against directory Appropriate transfers are performed Creates central bottleneck Effective in large scale systems with complex interconnection schemes

Snoopy Protocols Distribute cache coherence responsibility among cache controllers Cache recognizes that a line is shared Updates announced to other caches Suited to bus based multiprocessor Increases bus traffic

Write Invalidate Multiple readers, one writer When a write is required, all other caches of the line are invalidated Writing processor then has exclusive (cheap) access until line required by another processor Used in Pentium II and PowerPC systems State of every line is marked as modified, exclusive, shared or invalid MESI

Write Update Multiple readers and writers Updated word is distributed to all other processors Some systems use an adaptive mixture of both solutions

MESI State Transition Diagram

Clusters Alternative to SMP High performance High availability Server applications A group of interconnected whole computers Working together as unified resource Illusion of being one machine Each computer called a node

Cluster Benefits Absolute scalability Incremental scalability High availability Superior price/performance

Cluster Configurations - Standby Server, No Shared Disk

Cluster Configurations - Shared Disk

Cluster Configurations Passive standby Active secondary Separate servers Servers connected to disks Servers share disks

Operating Systems Issues Failure management Highly available Failover Failback Load balancing

Clusters v SMP Both use multiple processors for high demand applications SMP is easier to manage SMP takes less physical space and less power SMP established and stable technology Clusters are better for incremental and absolute scalability Clusters are better for availability

Non-Uniform Memory Access NUMA Uniform memory access All processors have access to all pats of main memory Access time to all regions of memory the same Access time by all processors the same Non-uniform memory Access All processors have access to all memory using load and store Access time depends on region of memory being accessed Different processors access different regions of memory at different speeds Cache-coherent NUMA Cache coherence is maintained

CC-NUMA Organization

NUMA Pros and Cons Effective performance at higher level of parallelism than SMP Not transparently like SMP Need software changes Availability

Stallings Chapter 16 Required Reading