1 / 12

Lecture 5 Approaches to Concurrency: The Multiprocessor

Lecture 5 Approaches to Concurrency: The Multiprocessor. Outline. Some basics Granularity Amdahl’s Law Metrics (speedup, efficiency, redundancy) Multi-core (one thread spans an engine, multiple engines) Tightly coupled vs. Loosely coupled Interconnect Cache Coherency Memory Consistency

cleta
Download Presentation

Lecture 5 Approaches to Concurrency: The Multiprocessor

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 5Approaches to Concurrency: The Multiprocessor

  2. Outline • Some basics • Granularity • Amdahl’s 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 • Amdahl’s 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. Metrics • Speed-up: • Efficiency: • Utilization: • Redundancy:

  6. Outline • Some basics • Granularity • Amdahl’s 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

  7. 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 • Programmer’s job is tougher

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

  9. Outline • Some basics • Granularity • Amdahl’s 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

More Related