Memory Hierarchy David Kilgore CS 147 Dr. Lee Spring 2008.

Slides:



Advertisements
Similar presentations
COMPUTER SYSTEMS An Integrated Approach to Architecture and Operating Systems Chapter 9 Memory Hierarchy ©Copyright 2008 Umakishore Ramachandran and William.
Advertisements

C SINGH, JUNE 7-8, 2010IWW 2010, ISATANBUL, TURKEY Advanced Computers Architecture, UNIT 2 Advanced Computers Architecture UNIT 2 CACHE MEOMORY Lecture7.
CP1610: Introduction to Computer Components Primary Memory.
1 Parallel Scientific Computing: Algorithms and Tools Lecture #2 APMA 2821A, Spring 2008 Instructors: George Em Karniadakis Leopold Grinberg.
Caches Hakim Weatherspoon CS 3410, Spring 2011 Computer Science Cornell University See P&H 5.1, 5.2 (except writes)
CMPE 421 Parallel Computer Architecture MEMORY SYSTEM.
11/14/05 ELEC Virtual Memory -Neha Jain -Neha Jain.
Recitation 7 Caching By yzhuang. Announcements Pick up your exam from ECE course hub ◦ Average is 43/60 ◦ Final Grade computation? See syllabus
1 Lecture 20 – Caching and Virtual Memory  2004 Morgan Kaufmann Publishers Lecture 20 Caches and Virtual Memory.
Review of Mem. HierarchyCSCE430/830 Review of Memory Hierarchy CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng Zhu (U.
Technology Component: Computer Hardware – Part 2 Basic Components Dr. V.T. Raja Oregon State University.
CIS °The Five Classic Components of a Computer °Today’s Topics: Memory Hierarchy Cache Basics Cache Exercise (Many of this topic’s slides were.
Computer ArchitectureFall 2007 © November 7th, 2007 Majd F. Sakr CS-447– Computer Architecture.
Technology Component: Computer Hardware – Part 2 Basic Components Dr. V.T. Raja Oregon State University.
1 SRAM: –value is stored on a pair of inverting gates –very fast but takes up more space than DRAM (4 to 6 transistors) DRAM: –value is stored as a charge.
4/6/2005 ECE Motivation for Memory Hierarchy What we want from memory  Fast  Large  Cheap There are different kinds of memory technologies  Register.
1 CSE SUNY New Paltz Chapter Seven Exploiting Memory Hierarchy.
Memory COMPUTER ORGANIZATION – ITC CPU (processing) Random Access Memory RAM Temporarily holds Data or Instruction 3.
Systems I Locality and Caching
1 Instant replay  The semester was split into roughly four parts. —The 1st quarter covered instruction set architectures—the connection between software.
Memory Main memory consists of a number of storage locations, each of which is identified by a unique address The ability of the CPU to identify each location.
Random access memory.
Memory Hierarchy 1 Computer Organization II © CS:APP & McQuain Cache Memory and Performance Many of the following slides are taken with.
CS1104: Computer Organisation School of Computing National University of Singapore.
1 CSCI 2510 Computer Organization Memory System I Organization.
IT253: Computer Organization Lecture 11: Memory Tonga Institute of Higher Education.
What is cache memory?. Cache Cache is faster type of memory than is found in main memory. In other words, it takes less time to access something in cache.
EEL5708/Bölöni Lec 4.1 Fall 2004 September 10, 2004 Lotzi Bölöni EEL 5708 High Performance Computer Architecture Review: Memory Hierarchy.
The Goal: illusion of large, fast, cheap memory Fact: Large memories are slow, fast memories are small How do we create a memory that is large, cheap and.
CSE378 Intro to caches1 Memory Hierarchy Memory: hierarchy of components of various speeds and capacities Hierarchy driven by cost and performance In early.
1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Chapter 2 Parallel Hardware and Parallel Software An Introduction to Parallel Programming Peter Pacheco.
Central Processing Unit (CPU) MATTHEW BOWEN. Function  The function of the CPU is to execute all of the commands and calculations or “processes” that.
A memory is just like a human brain. It is used to store data and instructions. Computer memory is the storage space in computer where data is to be processed.
CS2100 Computer Organisation Cache I (AY2015/6) Semester 1.
1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.
1  1998 Morgan Kaufmann Publishers Chapter Seven.
Lecture 5: Memory Performance. Types of Memory Registers L1 cache L2 cache L3 cache Main Memory Local Secondary Storage (local disks) Remote Secondary.
Memory 2. Activity 1 Research / Revise what cache memory is. 5 minutes.
Adapted from Computer Organization and Design, Patterson & Hennessy, UCB ECE232: Hardware Organization and Design Part 14: Memory Hierarchy Chapter 5 (4.
What is it and why do we need it? Chris Ward CS147 10/16/2008.
CSE373: Data Structures & Algorithms Lecture 26: Memory Hierarchy and Locality 1 Kevin Quinn, Fall 2015.
Primary Storage The Triplets – ROM & RAM & Cache.
Advanced Computer Architecture CS 704 Advanced Computer Architecture Lecture 26 Memory Hierarchy Design (Concept of Caching and Principle of Locality)
Cache Advanced Higher.
CMSC 611: Advanced Computer Architecture
COSC3330 Computer Architecture
Memory P2 Understand hardware technologies for game platforms
OCR GCSE Computer Science Teaching and Learning Resources
The Goal: illusion of large, fast, cheap memory
Memory Main memory consists of a number of storage locations, each of which is identified by a unique address The ability of the CPU to identify each location.
Memory Main memory consists of a number of storage locations, each of which is identified by a unique address The ability of the CPU to identify each location.
Computer Organization
Central Processing Unit (CPU)
CS 704 Advanced Computer Architecture
Today How’s Lab 3 going? HW 3 will be out today
Architecture Background
CS 105 Tour of the Black Holes of Computing
CACHE MEMORY.
Local secondary storage (local disks)
The Triplets – ROM & RAM & Cache
Computer Architecture 2
Computer System Hardware Memory Characteristics
CSCI206 - Computer Organization & Programming
Caches 2 Hakim Weatherspoon CS 3410, Spring 2013 Computer Science
Memory P2 Understand hardware technologies for game platforms
Morgan Kaufmann Publishers Memory Hierarchy: Introduction
PIPELINING Santosh Lakkaraju CS 147 Dr. Lee.
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,
Cache Memory and Performance
Presentation transcript:

Memory Hierarchy David Kilgore CS 147 Dr. Lee Spring 2008

How can I make my computer faster? What new components do I need?

Speed There are many different ways to increase the speed at which your programs run on your computers

Speed Having a good memory hierarchy can of course help a computer system operate as fast as possible

Memory Hierarchy The memory hierarchy of a computer system can be custimized by swapping different parts of the system with faster storage

Big Picture

Big (more detailed) Picture

Relative Cost and Speed The closer you get to the CPU, the higher the cost The farther away from the CPU, the more storage you get

Cache The CPU first fetches instructions from Level 1 and Level 2 cache Reduce memory access latency to main memory devices

Main Memory Main memory was intended to reduce latency between the CPU and secondary storage devices Types include SRAM, DRAM, and DDR SDRAM

Secondary Memory Have long access times Plentiful in data storage and relatively cheap

Locality of Programs The speed of a computer can be influenced at the program level in non-algorithmic ways

Locality of Programs When writing programs, it is best to write programs that have high locality

Locality of Programs Spatial locality  The idea that if data is accessed, nearby data will likely be accessed in the near future Temporal locality  The idea that if data is accessed, that same data will likely bee accessed in the near future

Summary We have seen that increasing a computer's speed involves many different hardware parts These parts work together to get instructions to the CPU as fast as possible