Assignment 4 – (a) Consider a symmetric MP with two processors and a cache invalidate write-back cache. Each block corresponds to two words in memory.

Slides:



Advertisements
Similar presentations
Chapter 5 Part I: Shared Memory Multiprocessors
Advertisements

Vector: Data Layout Vector: x[n] P processors Assume n = r * p
Parallel Processing Problems Cache Coherence False Sharing Synchronization.
MESI cache coherence protocol
To Include or Not to Include? Natalie Enright Dana Vantrease.
Practical Caches COMP25212 cache 3. Learning Objectives To understand: –Additional Control Bits in Cache Lines –Cache Line Size Tradeoffs –Separate I&D.
4/16/2013 CS152, Spring 2013 CS 152 Computer Architecture and Engineering Lecture 19: Directory-Based Cache Protocols Krste Asanovic Electrical Engineering.
Cache Optimization Summary
CSE 490/590, Spring 2011 CSE 490/590 Computer Architecture Directory-Based Caches I Steve Ko Computer Sciences and Engineering University at Buffalo.
1 Lecture 2: Snooping and Directory Protocols Topics: Snooping wrap-up and directory implementations.
1 Lecture 3: Snooping Protocols Topics: snooping-based cache coherence implementations.
CS 152 Computer Architecture and Engineering Lecture 21: Directory-Based Cache Protocols Scott Beamer (substituting for Krste Asanovic) Electrical Engineering.
April 18, 2011CS152, Spring 2011 CS 152 Computer Architecture and Engineering Lecture 19: Directory-Based Cache Protocols Krste Asanovic Electrical Engineering.
VIRTUAL MEMORY. Virtual memory technique is used to extents the size of physical memory When a program does not completely fit into the main memory, it.
1 Cache coherence CEG 4131 Computer Architecture III Slides developed by Dr. Hesham El-Rewini Copyright Hesham El-Rewini.
Cache Control and Cache Coherence Protocols How to Manage State of Cache How to Keep Processors Reading the Correct Information.
Ch4. Multiprocessors & Thread-Level Parallelism 2. SMP (Symmetric shared-memory Multiprocessors) ECE468/562 Advanced Computer Architecture Prof. Honggang.
Computer Architecture Lecture 26 Fasih ur Rehman.
Multiprocessor cache coherence. Caching: terms and definitions cache line, line size, cache size degree of associativity –direct-mapped, set and fully.
S YMMETRIC S HARED M EMORY A RCHITECTURE Presented By: Rahul M.Tech CSE, GBPEC Pauri.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 April 5, 2005 Session 22.
Influence Of The Cache Size On The Bus Traffic Mohd Azlan bin Hj. Abd Rahman M
CSE 351 Final Exam Review 1. The final exam will be comprehensive, but more heavily weighted towards material after the midterm We will do a few problems.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 March 20, 2008 Session 9.
Computer Science and Engineering Copyright by Hesham El-Rewini Advanced Computer Architecture CSE 8383 February Session 13.
Draw, Color, and Label Chloroplast Assignment Completed (B day) Completed (A day)
Understanding Parallel Computers Parallel Processing EE 613.
Project Summary Fair and High Throughput Cache Partitioning Scheme for CMPs Shibdas Bandyopadhyay Dept of CISE University of Florida.
Multiprocessor  Use large number of processor design for workstation or PC market  Has an efficient medium for communication among the processor memory.
Cache Operation.
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 April 7, 2005 Session 23.
The University of Adelaide, School of Computer Science
COSC2410: LAB 19 INTRODUCTION TO MEMORY/CACHE DIRECT MAPPING 1.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Centralized Multiprocessor.
CSCI2510 Tutorial 5 Introduction to Cache Zong Wen
Address – 32 bits WRITE Write Cache Write Main Byte Offset Tag Index Valid Tag Data 16K entries 16.
CAM Content Addressable Memory
Direct Cache Structure
Replacement Policy Replacement policy:
Computer Engineering 2nd Semester
QuickPath interconnect GB/s GB/s total To I/O
continued on next slide
Multiprocessor Cache Coherency
Memory Hierarchy Virtual Memory, Address Translation
Cache Coherence Constructive Computer Architecture Arvind
                                                                                                                                                                                                                                                
Krste Asanovic Electrical Engineering and Computer Sciences
continued on next slide
continued on next slide
Directory-based Protocol
Lecture 2: Snooping-Based Coherence
FIGURE 12-1 Memory Hierarchy
Module IV Memory Organization.
Set-Associative Cache
Interconnect with Cache Coherency Manager
Help! How does cache work?
Module IV Memory Organization.
11 – Snooping Cache and Directory Based Multiprocessors
CSE 351: The Hardware/Software Interface
How can we find data in the cache?
Lecture 10: Consistency Models
Slides developed by Dr. Hesham El-Rewini Copyright Hesham El-Rewini
Cache coherence CEG 4131 Computer Architecture III
Lecture 24: Virtual Memory, Multiprocessors
Lecture 23: Virtual Memory, Multiprocessors
Module IV Memory Organization.
Readahead FSMs, Readback FSMs, and Reduce States
continued on next slide
Lecture 11: Consistency Models
continued on next slide
Presentation transcript:

Assignment 4 – (a) Consider a symmetric MP with two processors and a cache invalidate write-back cache. Each block corresponds to two words in memory. The initial state of memory and the caches are shown in the next slide. Complete the state of each of the two caches after each of the references indicated at the bottom left of each subsequent slide. Assume that new entries coming to a cache replace the entry with a state of invalid (I) that has the lowest tag number. You need to show the entire cache state in each slide, not just the change! You need to turn in all the slides (in hardcopy).

Interconnect with Cache Coherency Manager Processor 0 Processor 1 Block State Tag Data Block State Tag Data B0 I 100 00 10 B0 S 108 00 08 B1 S 108 00 08 B1 M 128 20 10 B2 M 110 00 10 B2 I 130 10 12 B3 I I 118 00 18 B3 120 10 28 Interconnect with Cache Coherency Manager Tag Block Data Memory 100 00 10 Initial State 108 00 08 110 00 10 118 00 18 120 10 28 128 20 10 130 10 12 132 40 12 134 10 22

Interconnect with Cache Coherency Manager Processor 0 Processor 1 Block State Tag Data Block State Tag Data B0 B0 B1 B1 B2 B2 B3 B3 Interconnect with Cache Coherency Manager Tag Block Data Memory 100 00 10 After reference 1: P0: read 128 108 00 08 110 00 10 118 00 18 120 10 28 128 20 10 130 10 12 132 40 12 134 10 22

Interconnect with Cache Coherency Manager Processor 0 Processor 1 Block State Tag Data Block State Tag Data B0 B0 B1 B1 B2 B2 B3 B3 Interconnect with Cache Coherency Manager Tag Block Data Memory 100 00 10 After reference 2: P1: read 132 108 00 08 110 00 10 118 00 18 120 10 28 128 20 10 130 10 12 132 40 12 134 10 22

Interconnect with Cache Coherency Manager Processor 0 Processor 1 Block State Tag Data Block State Tag Data B0 B0 B1 B1 B2 B2 B3 B3 Interconnect with Cache Coherency Manager Tag Block Data Memory 100 00 10 After reference 3: P0: write 128  20 15 108 00 08 110 00 10 118 00 18 120 10 28 128 20 10 130 10 12 132 40 12 134 10 22

Interconnect with Cache Coherency Manager Processor 0 Processor 1 Block State Tag Data Block State Tag Data B0 B0 B1 B1 B2 B2 B3 B3 Interconnect with Cache Coherency Manager Tag Block Data Memory 100 00 10 After reference 4: P1: read 128 108 00 08 110 00 10 118 00 18 120 10 28 128 20 10 130 10 12 132 40 12 134 10 22

Interconnect with Cache Coherency Manager Processor 0 Processor 1 Block State Tag Data Block State Tag Data B0 B0 B1 B1 B2 B2 B3 B3 Interconnect with Cache Coherency Manager Tag Block Data Memory 100 00 10 After reference 5: P0: reads 110 108 00 08 110 00 10 118 00 18 120 10 28 128 20 10 130 10 12 132 40 12 134 10 22

Interconnect with Cache Coherency Manager Processor 0 Processor 1 Block State Tag Data Block State Tag Data B0 B0 B1 B1 B2 B2 B3 B3 Interconnect with Cache Coherency Manager Tag Block Data Memory 100 00 10 After reference 6: P1: reads 110 108 00 08 110 00 10 118 00 18 120 10 28 128 20 10 130 10 12 132 40 12 134 10 22

Interconnect with Cache Coherency Manager Processor 0 Processor 1 Block State Tag Data Block State Tag Data B0 B0 B1 B1 B2 B2 B3 B3 Interconnect with Cache Coherency Manager Tag Block Data Memory 100 00 10 Memory after cache write-back: 108 00 08 110 00 10 118 00 18 120 10 28 128 130 10 12 132 40 12 134 10 22