Outline, October 2CS-3013 A-term 20091Outline, October 2CS-3013 A-term 20091 Outline for October 2 Review:– Caches and Quantification of Cache Performance.

Slides:



Advertisements
Similar presentations
1 Lecture 13: Cache and Virtual Memroy Review Cache optimization approaches, cache miss classification, Adapted from UCB CS252 S01.
Advertisements

Paging 1 CS502 Spring 2006 Paging CS-502 Operating Systems.
Virtual Memory. Hierarchy Cache Memory : Provide invisible speedup to main memory.
CMPE 421 Parallel Computer Architecture MEMORY SYSTEM.
11/14/05 ELEC Virtual Memory -Neha Jain -Neha Jain.
Cs 325 virtualmemory.1 Accessing Caches in Virtual Memory Environment.
Virtual Memory Adapted from lecture notes of Dr. Patterson and Dr. Kubiatowicz of UC Berkeley.
Spring 2003CSE P5481 Introduction Why memory subsystem design is important CPU speeds increase 55% per year DRAM speeds increase 3% per year rate of increase.
Chapter 101 Virtual Memory Chapter 10 Sections and plus (Skip:10.3.2, 10.7, rest of 10.8)
CSCE 212 Chapter 7 Memory Hierarchy Instructor: Jason D. Bakos.
Recap. The Memory Hierarchy Increasing distance from the processor in access time L1$ L2$ Main Memory Secondary Memory Processor (Relative) size of the.
The Memory Hierarchy II CPSC 321 Andreas Klappenecker.
CIS °The Five Classic Components of a Computer °Today’s Topics: Memory Hierarchy Cache Basics Cache Exercise (Many of this topic’s slides were.
ECE 232 L27.Virtual.1 Adapted from Patterson 97 ©UCBCopyright 1998 Morgan Kaufmann Publishers ECE 232 Hardware Organization and Design Lecture 27 Virtual.
CS-3013 & CS-502 Summer 2006 Paging1 CS-3013 & CS-502 Summer 2006.
CS-3013 & CS-502, Summer 2006 Review Topics1 CS-3013 & CS-502 Operating Systems.
Computer ArchitectureFall 2007 © November 7th, 2007 Majd F. Sakr CS-447– Computer Architecture.
Computer Organization Cs 147 Prof. Lee Azita Keshmiri.
ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( )
©UCB CS 161 Ch 7: Memory Hierarchy LECTURE 24 Instructor: L.N. Bhuyan
Systems I Locality and Caching
CMPE 421 Parallel Computer Architecture
CMP 301A Computer Architecture 1 Lecture 4. Outline zVirtual memory y Terminology y Page Table y Translation Lookaside Buffer (TLB)
Virtual Memory CS Introduction to Operating Systems.
Chapter Twelve Memory Organization
0 High-Performance Computer Architecture Memory Organization Chapter 5 from Quantitative Architecture January 2006.
CSIE30300 Computer Architecture Unit 08: Cache Hsin-Chou Chi [Adapted from material by and
Chapter 9 Memory Organization By Jack Chung. MEMORY? RAM?
PagingCS-502 Fall Paging CS-502 Operating Systems Fall 2006 (Slides include materials from Operating System Concepts, 7 th ed., by Silbershatz, Galvin,
3-May-2006cse cache © DW Johnson and University of Washington1 Cache Memory CSE 410, Spring 2006 Computer Systems
Virtual Memory. DRAM as cache What about programs larger than DRAM? When we run multiple programs, all must fit in DRAM! Add another larger, slower level.
1 Virtual Memory Main memory can act as a cache for the secondary storage (disk) Advantages: –illusion of having more physical memory –program relocation.
Caching Principles & Paging Performance CS-502 (EMC) Fall Caching Principles and Paging Performance CS-502, Operating Systems Fall 2009 (EMC) (Slides.
Paging (continued) & Caching CS-3013 A-term Paging (continued) & Caching CS-3013 Operating Systems A-term 2008 (Slides include materials from Modern.
4.3 Virtual Memory. Virtual memory  Want to run programs (code+stack+data) larger than available memory.  Overlays programmer divides program into pieces.
Introduction: Memory Management 2 Ideally programmers want memory that is large fast non volatile Memory hierarchy small amount of fast, expensive memory.
Memory Architecture Chapter 5 in Hennessy & Patterson.
CS.305 Computer Architecture Memory: Caches Adapted from Computer Organization and Design, Patterson & Hennessy, © 2005, and from slides kindly made available.
Memory Hierarchy How to improve memory access. Outline Locality Structure of memory hierarchy Cache Virtual memory.
Lecture 5: Memory Performance. Types of Memory Registers L1 cache L2 cache L3 cache Main Memory Local Secondary Storage (local disks) Remote Secondary.
LECTURE 12 Virtual Memory. VIRTUAL MEMORY Just as a cache can provide fast, easy access to recently-used code and data, main memory acts as a “cache”
What is it and why do we need it? Chris Ward CS147 10/16/2008.
Summary of caches: The Principle of Locality: –Program likely to access a relatively small portion of the address space at any instant of time. Temporal.
1 How will execution time grow with SIZE? int array[SIZE]; int sum = 0; for (int i = 0 ; i < ; ++ i) { for (int j = 0 ; j < SIZE ; ++ j) { sum +=
Memory Management memory hierarchy programs exhibit locality of reference - non-uniform reference patterns temporal locality - a program that references.
Memory Management & Virtual Memory. Hierarchy Cache Memory : Provide invisible speedup to main memory.
Virtual Memory (Section 9.3). The Need For Virtual Memory Many computers don’t have enough memory in RAM to accommodate all the programs a user wants.
Cache Advanced Higher.
CMSC 611: Advanced Computer Architecture
Improving Memory Access The Cache and Virtual Memory
Virtual Memory Chapter 7.4.
CS352H: Computer Systems Architecture
Lecture 12 Virtual Memory.
Ramya Kandasamy CS 147 Section 3
Local secondary storage (local disks)
Cache By: Thanh Nguyen.
Lecture 28: Virtual Memory-Address Translation
CSCI206 - Computer Organization & Programming
Chapter 8 Digital Design and Computer Architecture: ARM® Edition
ECE 445 – Computer Organization
Lecture 29: Virtual Memory-Address Translation
Caching Principles and Paging Performance
10/16: Lecture Topics Memory problem Memory Solution: Caches Locality
TLB Performance Seung Ki Lee.
Caching Principles and Paging Performance
ECE 463/563 Fall `18 Memory Hierarchies, Cache Memories H&P: Appendix B and Chapter 2 Prof. Eric Rotenberg Fall 2018 ECE 463/563, Microprocessor Architecture,
Outline for October 9 Input and Output (continued)
Fundamentals of Computing: Computer Architecture
Cache Memory and Performance
CS-3013 Operating Systems A-term 2008
Presentation transcript:

Outline, October 2CS-3013 A-term 20091Outline, October 2CS-3013 A-term Outline for October 2 Review:– Caches and Quantification of Cache Performance Virtual Memory Management (continued) Introduction to Protection and Security

Outline, October 2CS-3013 A-term Definition — Cache A small subset of active items held in small, fast storage while most of the items remain in much larger, slower storage

Outline, October 2CS-3013 A-term General Observation on Caching We create caches because There is not enough fast memory to hold everything we need Memory that is large enough is too slow Performance metric for all caches is EAT Effective Access Time Goal is to make overall performance close to cache memory performance By taking advantage of locality — temporal and spatial By burying a small number of accesses to slow memory under many, many accesses to fast memory

Outline, October 2CS-3013 A-term Definition – Effective Access Time (EAT) The average access time to memory items, where some items are cached in fast storage and other items are not cached… …weighted by p, the fault rate 0 ≤ p < 1 EAT = (1-p) * (cache access time) + p * (non-cache access time)

Outline, October 2CS-3013 A-term Goal of Caching To take advantage of locality to achieve nearly the same performance of the fast memory when most data is in slow memory I.e., solve EAT equation for p (1-p)*(cache_time) + p*(non_cache_time) < (1+x)*(cache_time) EAT x is “acceptable” performance

Outline, October 2CS-3013 A-term Goal of Caching (continued) Select size of cache and size of cache items so that p is low enough to meet acceptable performance goal Usually requires simulation of suite of benchmarks

Outline, October 2CS-3013 A-term Cache Applications Physical memory: cache of virtual memory I.e., RAM over disk TLB: cache of page table entries I.e., Registers over RAM Processor L2 cache: over RAM I.e., nanosecond memory over 10’s of nanoseconds Processor L1 cache: over L2 cache I.e., picosecond registers over nanosecond memory …

Outline, October 2CS-3013 A-term Cache Applications (continued) Recently accessed blocks of a file I.e., RAM over disk blocks Today’s airline flights I.e., local disk over remote disk

Outline, October 2CS-3013 A-term Questions?