Lecture%205%20Approaches%20to%20Concurrency:%20The%20Multiprocessor - PowerPoint PPT Presentation

About This Presentation
Title:

Lecture%205%20Approaches%20to%20Concurrency:%20The%20Multiprocessor

Description:

Title: PowerPoint Presentation Last modified by: Yale Patt Created Date: 1/1/1601 12:00:00 AM Document presentation format: On-screen Show Other titles – PowerPoint PPT presentation

Number of Views:82
Avg rating:3.0/5.0
Slides: 13
Provided by: utexasEdu
Category:

less

Transcript and Presenter's Notes

Title: Lecture%205%20Approaches%20to%20Concurrency:%20The%20Multiprocessor


1
Lecture 5Approaches to Concurrency The
Multiprocessor
2
Outline
  • Some basics
  • Granularity
  • Amdahls Law
  • Metrics (speedup, efficiency, redundancy)
  • Multi-core (one thread spans an engine, multiple
    engines)
  • Tightly coupled vs. Loosely coupled
  • Interconnect
  • Cache Coherency
  • Memory Consistency
  • Examples
  • Early cm, HEP, cosmic cube
  • Recent cell, power, niagara, larrabee
  • Tomorrow ACMP

3
Outline
  • Some basics
  • Granularity
  • Amdahls Law
  • Metrics (speedup, efficiency, redundancy)
  • Multi-core (one thread spans an engine, multiple
    engines)
  • Tightly coupled vs. Loosely coupled
  • Interconnect
  • Cache Coherency
  • Memory Consistency
  • Examples
  • Early cm, HEP, cosmic cube
  • Recent cell, power, niagara, larrabee
  • Tomorrow ACMP

4
Granularity of Concurrency
  • Intra-instruction (Pipelining)
  • Parallel instructions (SIMD, VLIW)
  • Tight-coupled MP
  • Loosely-coupled MP

5
(No Transcript)
6
Metrics
  • Speed-up
  • Efficiency
  • Utilization
  • Redundancy

7
Outline
  • Some basics
  • Granularity
  • Amdahls Law
  • Metrics (speedup, efficiency, redundancy)
  • Multi-core (one thread spans an engine, multiple
    engines)
  • Tightly coupled vs. Loosely coupled
  • Interconnect
  • Cache Coherency
  • Memory Consistency
  • Examples
  • Early cm, HEP, cosmic cube
  • Recent cell, power, niagara, larrabee
  • Tomorrow ACMP

8
Tightly-coupled vs Loosely-coupled
  • Tightly coupled (i.e., Multiprocessor)
  • Shared memory
  • Each processor capable of doing work on its own
  • Easier for the software
  • Hardware has to worry about cache coherency,
  • memory contention
  • Loosely-coupled (i.e., Multicomputer Network)
  • Message passing
  • Easier for the hardware
  • Programmers job is tougher

9
  • Interconnection networks
  • Cost
  • Latency
  • Contention
  • Cache Cohererency
  • Snoopy
  • Directory
  • Memory Consistency
  • Sequential Consistency and Mutual Exclusion

10
Outline
  • Some basics
  • Granularity
  • Amdahls Law
  • Metrics (speedup, efficiency, redundancy)
  • Multi-core (one thread spans an engine, multiple
    engines)
  • Tightly coupled vs. Loosely coupled
  • Interconnect
  • Cache Coherency
  • Memory Consistency
  • Examples
  • Early cm, HEP, cosmic cube
  • Recent cell, power, niagara, larrabee
  • Tomorrow ACMP

11
(No Transcript)
12
(No Transcript)
Write a Comment
User Comments (0)
About PowerShow.com