lec26 - LECTURE - 26 Lecture Outline Cache coherence...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: LECTURE - 26 Lecture Outline Cache coherence protocols (continued) Snooping-based schemes Directory-based schemes Scribe for today? Snooping-Based Protocols Applicable for write-through as well as writeback caches Optimizations: Shared/Exclusive bit Write miss and invalidate messages Shared+single versus truly shared blocks Maintaining separate tags Dirty bit required? Towards Directory-Based Protocols What properties of the multi-processor does a snooping-based protocol use? Broadcast-based bus, all-to-all communication What if this is not possible? Communication goes through a directory Directory is logically shared across processors Physically centralized or distributed Directory entry per memory-block Possible states: uncached, shared, exclusive Use bit-vectors for storing these ...
View Full Document

This note was uploaded on 07/14/2011 for the course CS 422 taught by Professor Hogakoi during the Spring '10 term at IIT Kanpur.

Page1 / 4

lec26 - LECTURE - 26 Lecture Outline Cache coherence...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online