Lecture

Cache Coherence

Related lectures (73)
Cache Coherence: Basics and Protocols
Explores cache coherence challenges, protocols, and directory-based solutions in multi-core systems.
Cache Memory
Explores cache memory design, hits, misses, and eviction policies in computer systems, emphasizing spatial and temporal locality.
Memory Cache Principles
Explores memory cache principles, emphasizing spatial locality, latency impact, and cache efficiency strategies.
Cache Coherence: Basics and Protocols
Explores cache coherence in multiprocessor systems, discussing basic protocols and challenges of shared data among CPUs.
Memory Hierarchy and Cache Performance
Explores virtual memory, page tables, TLB, and cache memory in computer systems.
Multi Masters Systems
Explores Multi Masters Systems, discussing architectures with multiple processors, shared memory, mutual exclusion, and hardware accelerators.
Basic Cache Coherence
Introduces the basics of cache coherence, covering cache organization, coherence protocols, and challenges in multi-level cache hierarchies.
Direct-mapped and Annex Caches
Covers direct-mapped and annex caches in computer architecture, explaining cache structure, access patterns, hit rates, and latency calculations.
Memories: Evolution and Types
Explores the evolution and taxonomy of memories, focusing on SRAM and DRAM differences, memory layout, and functional taxonomy.
Virtual Memory
Covers virtual memory, program relocation, memory protection, TLB, and memory hierarchy interactions.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.