Taking Advantage of Oracle Rdb Memory Management Features. Norman Lastovica Oracle Rdb Engineering November 14, 06
|
|
- Elinor Parrish
- 5 years ago
- Views:
Transcription
1 Taking Advantage of Oracle Rdb Memory Management Features Norman Lastovica Oracle Rdb Engineering November 14, 06
2 Overview Background Virtual Memory Translation Buffer CPU caches Alignment faults Resident Images Reserved Memory Registry Performance Impacts 2
3 Physical vs Virtual Memory Physical memory The memory chips in computer Virtual memory Mapped from virtual to physical Process s view of memory Protection / Permission Virtual can often be larger than physical 3
4 VMS Virtual address space 32-Bit addressing P0 1gb process private P1 1gb process private S0S1 2gb system-wide shared space 64-bit addressing 8 TB minimum P2 Process private S2 System-wide shared space 4
5 Page Unit of memory access protection VAX = 512 bytes Alpha & I64 currently = 8192 bytes Physical page sometimes called Page Frame 5
6 6 Physical & Virtual
7 Page Table Entry Describes virtual page Physical page location Per-mode page state, protection & permission 7
8 Page Table Collection of page table entries Private page tables Shared page tables for shared memory Shared page tables for system address space 8
9 Translation Buffer CPU cache of information from page table entry Limited number available EV7 has 128 ITB & 128 DTB Itanium has ITB and DTB Invalidated at certain events (i.e. page fault) 9
10 Alpha EV6/EV7 TB A demand-paged memory-management unit with translation buffer, which, when used with PALcode, can implement a variety of page table structures and translation algorithms. The unit consists of a 128-entry, fullyassociative data translation buffer (DTB) and a 128-entry, fully-associative instruction translation buffer (ITB), with each entry able to map a single 8KB page or a group of 8, 64, or 512 8KB pages. The allocation scheme for the ITB and DTB is round-robin. The size of each translation buffer entry s group is specified by hint bits stored in the entry. The DTB and ITB implement 8-bit address space numbers (ASN), MAX_ASN=
11 Granularity Hint (aka Huge Page) Single entry describes multiple pages Contiguous physical pages Contiguous virtual pages All have same protection characteristics Reduces translation buffer cache misses Varied size Alpha 8K, 64K, 512K, 4M I64 4K, 8K, 16K, 64K, 256K, 1M, 4M, 16M, 64M, 256M, 4G 11
12 Resident Images Image content resident in physical memory No page faults Granularity hints Mapped in system address space S0S1 S2 starting with I64 V8.3 Users share one copy of pages & page tables 12
13 Resident Global Sections Content resident in physical memory Mapped in P0, P1 or P2 address space No page faults Optional shared page tables All users share one copy of pages Saves memory for large sections & many users 13
14 CPU Cycle vs. Memory Latency rx4640 (1.6GHz) GS1280 (1.3Ghz) 0.63 nsec cycle time 0.77 nsec cycle time GS320 (32P/32C, 1.2GHz) Superdome (32P/32C, 1.5GHz) GS1280 (32P/32C, 1.3GHz) Arches/Montecito (16P/32C, 1.6 GHz) 825 nsec latency 417 nsec latency 225 nsec latency 334 nsec latency 14
15 CPU Caches Faster, smaller memory closer to CPU Copy of memory content for faster access Several levels of different sizes & speeds CPU 4kb L1 Cache 2mb L2 Cache 16gb Main Memory 15
16 Pre-Fetching into CPU Cache When needed memory known ahead of time Significant performance improvements possible for some algorithms Accessing all data in a buffer Can pre-fetch cache lines ahead of loop to reduce effective memory latency 16
17 Aligned & Unaligned Data expected to be on natural boundary If data known at compile-time to be unaligned, additional instructions generated If data known aligned at compile-time but is not aligned, hardware raises alignment fault & software fixes up reference 17
18 Reserved Memory Registry Optional list of pre-reserved physical memory at system boot for global sections Allows application global sections to be resident with shared page tables & granularity hints 18
19 Global Sections & Granularity Hint Regions Wells TNA27:> MCR SYSMAN RESERVED_MEMORY ADD NJL$SHARED_MEMORY /PAGE_TABLES /SIZE=1100 /ALLOCATE Wells TNA3:> SHOW MEMORY /RESERVE Memory Reservations (pages): Group Reserved In Use Type NJL$SHARED_MEMORY SYSGBL Page Table NJL$SHARED_MEMORY SYSGBL Allocated NJL$SHARED_MEMORY SYSGBL Allocated NJL$SHARED_MEMORY SYSGBL Allocated Total (1.07 GBytes reserved)
20 Using GH Regions 05: : : : : : : : : :43 03:23 CPU Time Single User 1Gb global section 100,000,000 loops Increment random QW rx p No GH rx p GH 20
21 Resident Images With Rdb Various Rdb images installed resident Pass /RESIDENT as parameter Execute prior to end of SYSTARTUP_VMS 21
22 Reserved Memory Resident Sections With Rdb Various Rdb global sections can be resident SHARED MEMORY IS PROCESS RESIDENT RMU/DUMP/HEADER to find section names & sizes SYSMAN to register the sections 22
23 Reserving Memory for Rdb Global Sections Nhgal8 TNA4:> SQL$ ALTER DATA FILE X$ - SHARED MEMORY IS PROCESS RESIDENT Nhgal8 TNA4:> RMU /DUMP /HEADER /OUTPUT=X.X X$ Nhgal8 TNA4:> SEARCH X.X SECTION NAME IS /WINDOW=10 - Global section size With global buffers disabled is 2,047,042 bytes (2MB) With global buffers enabled is 33,860,114 bytes (33MB) - Global Section Name is RDM72N$1$DGA C Row cache I7 Shared Memory... - Shared memory will be mapped resident - Global Section Name is RDM72R$1$DGA C Shared memory section requirement is 96,340,608 bytes (97MB) Nhgal8 TNA4:> MCR SYSMAN RESERVED_MEMORY ADD /ALLOCATE /SIZE=33 RDM72N$1$DGA C Nhgal8 TNA4:> MCR SYSMAN RESERVE_MEMORY ADD /ALLOCATE /SIZE=97 RDM72R$1$DGA C
24 Testing Effects of Features Application does one index-only lookup per transaction 100% CPU bound ~75% executive mode 4 users, no waiting 24
25 Rx ghz Baseline +Rdb Installed /RESIDENT +Registered RC & TROOT Sections 25
26 GS mhz Baseline +Rdb Installed /RESIDENT +Registered RC & TROOT Sections 26
27 Buffer Objects & Fast IO Avoid locking & probing buffer for each IO Enables use of FAST IO services (vs $QIO) Requires OpenVMS rights identifier RMU /SET BUFFER_OBJECT /ENABLE = 27
28 Buffer Objects & FAST IO Creating Indexes 43: : : : : : : :40.3 Elapsed CPU 14: : : Block Buffers BufferObjects 28
29 Credits & Special Thanks Joe Famularo John King Kevin St George Tom Beaudin Brian Allison Mark DeYoung Steve Lieman Martin Ramshaw Guy Peleg Roxanne Young Paul Mead Ian Smith Christian Moser Karen Noel Guenther Froehlin Greg Jordan Tom Cafarella John Reagan 29
30 Q & A A N S W E R S Q U E S T I O N S A N S W E R S norman.lastovica@oracle.com 30
OpenVMS Performance Update
OpenVMS Performance Update Gregory Jordan Hewlett-Packard 2007 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice Agenda System Performance Tests
More informationOracle Rdb on OpenVMS Galaxy
http://www.oracle.com/rdb Oracle Rdb on OpenVMS Galaxy Norman Lastovica Oracle Rdb Engineering norman.lastovica@oracle.com www.oracle.com/rdb April 2, 2002 2 Agenda Existing performance implications Database
More informationHP OpenVMS Alpha and Integrity Performance Comparison
HP OpenVMS Alpha and Integrity Performance Comparison Session 1225 Gregory Jordan OpenVMS Engineering Hewlett-Packard 25 Hewlett-Packard Development Company, L.P. The information contained herein is subject
More informationOpenVMS Scaling on Large Integrity Servers. Guy Peleg President Maklee Engineering
OpenVMS Scaling on Large Integrity Servers Guy Peleg President Maklee Engineering guy.peleg@maklee.com Who we are What is Maklee? US Based consulting firm operating all over the world. Former members of
More informationGuide to Database Tuning: Row Cache Hints and Tricks
Guide to Database Tuning: Row Cache Hints and Tricks A feature of Oracle Rdb By Norm Lastovica Oracle Rdb Relational Technology Group Oracle Corporation 1 Oracle Rdb Journal Row Cache Hints and Tricks
More informationOpenVMS Alpha 64-bit Very Large Memory Design
OpenVMS Alpha 64-bit Very Large Memory Design Karen L. Noel Nitin Y. Karkhanis The OpenVMS Alpha version 7.1 operating system provides memory management features that extend the 64-bit VLM capabilities
More informationVirtual to physical address translation
Virtual to physical address translation Virtual memory with paging Page table per process Page table entry includes present bit frame number modify bit flags for protection and sharing. Page tables can
More informationOracle Rdb Release 7.2 & 7.2.1
Oracle Rdb Release 7.2 & 7.2.1 Norman Lastovica Oracle Rdb Engineering www.oracle.com/rdb November 14, 06 For decades, our customers have relied on Oracle Rdb to support large-scale production applications
More informationVirtual Memory: From Address Translation to Demand Paging
Constructive Computer Architecture Virtual Memory: From Address Translation to Demand Paging Arvind Computer Science & Artificial Intelligence Lab. Massachusetts Institute of Technology November 9, 2015
More information<Insert Picture Here> Oracle Rdb Releases 7.2, 7.2.1, 7.2.2, 7.2.3, 7.2.4, 7.2.5
Oracle Rdb Releases 7.2, 7.2.1, 7.2.2, 7.2.3, 7.2.4, 7.2.5 Norman Lastovica Oracle OpenVMS Development Team 19 April 2010 Agenda Rdb V7.2 Itanium migration V7.2
More informationOracle Rdb Buffering A Comparative Study. Magnus Weiman Paul Mead
Oracle Rdb Buffering A Comparative Study Magnus Weiman Paul Mead Agenda Explore various ways Rdb buffers data Examine pros and cons of buffering features 2 Test Case Multi-user test Rdb V7.1-401 Modified
More informationPorting OpenVMS to the Itanium Processor Family
Porting OpenVMS to the Itanium Processor Family Andy Goldstein (acknowledgements to OpenVMS Engineering Clair Grant) October, 2004 2004 Hewlett-Packard Development Company, L.P. The information contained
More informationMemory Management! How the hardware and OS give application pgms:" The illusion of a large contiguous address space" Protection against each other"
Memory Management! Goals of this Lecture! Help you learn about:" The memory hierarchy" Spatial and temporal locality of reference" Caching, at multiple levels" Virtual memory" and thereby " How the hardware
More informationChapter 5B. Large and Fast: Exploiting Memory Hierarchy
Chapter 5B Large and Fast: Exploiting Memory Hierarchy One Transistor Dynamic RAM 1-T DRAM Cell word access transistor V REF TiN top electrode (V REF ) Ta 2 O 5 dielectric bit Storage capacitor (FET gate,
More informationMemory: Page Table Structure. CSSE 332 Operating Systems Rose-Hulman Institute of Technology
Memory: Page Table Structure CSSE 332 Operating Systems Rose-Hulman Institute of Technology General address transla+on CPU virtual address data cache MMU Physical address Global memory Memory management
More informationCS5460: Operating Systems Lecture 14: Memory Management (Chapter 8)
CS5460: Operating Systems Lecture 14: Memory Management (Chapter 8) Important from last time We re trying to build efficient virtual address spaces Why?? Virtual / physical translation is done by HW and
More informationChapter 8. Virtual Memory
Operating System Chapter 8. Virtual Memory Lynn Choi School of Electrical Engineering Motivated by Memory Hierarchy Principles of Locality Speed vs. size vs. cost tradeoff Locality principle Spatial Locality:
More informationVirtual Memory. Patterson & Hennessey Chapter 5 ELEC 5200/6200 1
Virtual Memory Patterson & Hennessey Chapter 5 ELEC 5200/6200 1 Virtual Memory Use main memory as a cache for secondary (disk) storage Managed jointly by CPU hardware and the operating system (OS) Programs
More informationVirtual Memory. Virtual Memory
Virtual Memory Virtual Memory Main memory is cache for secondary storage Secondary storage (disk) holds the complete virtual address space Only a portion of the virtual address space lives in the physical
More informationOracle Rdb Space Management
Oracle Rdb Space Management Norman Lastovica Oracle Rdb Egnineering www.oracle.com/rdb November 13, 06 Agenda Data Structures Mixed vs uniform storage areas Logical areas AIP, ABM, SPAM Algorithms Free
More informationCS 31: Intro to Systems Virtual Memory. Kevin Webb Swarthmore College November 15, 2018
CS 31: Intro to Systems Virtual Memory Kevin Webb Swarthmore College November 15, 2018 Reading Quiz Memory Abstraction goal: make every process think it has the same memory layout. MUCH simpler for compiler
More informationMemory Management! Goals of this Lecture!
Memory Management! Goals of this Lecture! Help you learn about:" The memory hierarchy" Why it works: locality of reference" Caching, at multiple levels" Virtual memory" and thereby " How the hardware and
More informationTable of contents. OpenVMS scalability with Oracle Rdb. Scalability achieved through performance tuning.
OpenVMS scalability with Oracle Rdb Scalability achieved through performance tuning. Table of contents Abstract..........................................................2 From technical achievement to
More informationMemory Management. Goals of this Lecture. Motivation for Memory Hierarchy
Memory Management Goals of this Lecture Help you learn about: The memory hierarchy Spatial and temporal locality of reference Caching, at multiple levels Virtual memory and thereby How the hardware and
More information1. Creates the illusion of an address space much larger than the physical memory
Virtual memory Main Memory Disk I P D L1 L2 M Goals Physical address space Virtual address space 1. Creates the illusion of an address space much larger than the physical memory 2. Make provisions for
More informationVirtual Memory. Kevin Webb Swarthmore College March 8, 2018
irtual Memory Kevin Webb Swarthmore College March 8, 2018 Today s Goals Describe the mechanisms behind address translation. Analyze the performance of address translation alternatives. Explore page replacement
More informationCSE 4/521 Introduction to Operating Systems. Lecture 14 Main Memory III (Paging, Structure of Page Table) Summer 2018
CSE 4/521 Introduction to Operating Systems Lecture 14 Main Memory III (Paging, Structure of Page Table) Summer 2018 Overview Objective: To discuss how paging works in contemporary computer systems. Paging
More informationLearning Outcomes. An understanding of page-based virtual memory in depth. Including the R3000 s support for virtual memory.
Virtual Memory 1 Learning Outcomes An understanding of page-based virtual memory in depth. Including the R3000 s support for virtual memory. 2 Memory Management Unit (or TLB) The position and function
More informationLearning Outcomes. An understanding of page-based virtual memory in depth. Including the R3000 s support for virtual memory.
Virtual Memory Learning Outcomes An understanding of page-based virtual memory in depth. Including the R000 s support for virtual memory. Memory Management Unit (or TLB) The position and function of the
More informationRdb features for high performance application
Rdb features for high performance application Philippe Vigier Oracle New England Development Center Copyright 2001, 2003 Oracle Corporation Oracle Rdb Buffer Management 1 Use Global Buffers Use Fast Commit
More informationCUDA Optimization: Memory Bandwidth Limited Kernels CUDA Webinar Tim C. Schroeder, HPC Developer Technology Engineer
CUDA Optimization: Memory Bandwidth Limited Kernels CUDA Webinar Tim C. Schroeder, HPC Developer Technology Engineer Outline We ll be focussing on optimizing global memory throughput on Fermi-class GPUs
More informationRecall from Tuesday. Our solution to fragmentation is to split up a process s address space into smaller chunks. Physical Memory OS.
Paging 11/10/16 Recall from Tuesday Our solution to fragmentation is to split up a process s address space into smaller chunks. Physical Memory OS Process 3 Process 3 OS: Place Process 3 Process 1 Process
More informationVirtual Memory. CS 351: Systems Programming Michael Saelee
Virtual Memory CS 351: Systems Programming Michael Saelee registers cache (SRAM) main memory (DRAM) local hard disk drive (HDD/SSD) remote storage (networked drive / cloud) previously: SRAM
More informationRecall: Address Space Map. 13: Memory Management. Let s be reasonable. Processes Address Space. Send it to disk. Freeing up System Memory
Recall: Address Space Map 13: Memory Management Biggest Virtual Address Stack (Space for local variables etc. For each nested procedure call) Sometimes Reserved for OS Stack Pointer Last Modified: 6/21/2004
More informationVirtual Memory. Daniel Sanchez Computer Science & Artificial Intelligence Lab M.I.T. November 15, MIT Fall 2018 L20-1
Virtual Memory Daniel Sanchez Computer Science & Artificial Intelligence Lab M.I.T. L20-1 Reminder: Operating Systems Goals of OS: Protection and privacy: Processes cannot access each other s data Abstraction:
More informationVirtual Memory: From Address Translation to Demand Paging
Constructive Computer Architecture Virtual Memory: From Address Translation to Demand Paging Arvind Computer Science & Artificial Intelligence Lab. Massachusetts Institute of Technology November 12, 2014
More informationCOEN-4730 Computer Architecture Lecture 3 Review of Caches and Virtual Memory
1 COEN-4730 Computer Architecture Lecture 3 Review of Caches and Virtual Memory Cristinel Ababei Dept. of Electrical and Computer Engineering Marquette University Credits: Slides adapted from presentations
More informationCS 152 Computer Architecture and Engineering. Lecture 8 - Address Translation
CS 152 Computer Architecture and Engineering Lecture 8 - Translation Krste Asanovic Electrical Engineering and Computer Sciences University of California at Berkeley http://www.eecs.berkeley.edu/~krste!
More informationOpenVMS Performance Tips & Tricks. Guy Peleg President Maklee Engineering
OpenVMS Performance Tips & Tricks Guy Peleg President Maklee Engineering guy.peleg@maklee.com 1 Maklee Engineering Consulting firm operating all over the world. Team of Top Gun engineers. Former members
More informationPerformance of Various Levels of Storage. Movement between levels of storage hierarchy can be explicit or implicit
Memory Management All data in memory before and after processing All instructions in memory in order to execute Memory management determines what is to be in memory Memory management activities Keeping
More informationFind the physical addresses of virtual addresses: 0, 8192, 20, 4100, : : : : : 24684
Memory [KB = 1024 Bytes = 2 10 Bytes, MB = 1024 KB = 2 20 Bytes] 1. Virtual address space =? 64KB Physical address space =? 32KB Page size =? 4KB # of pages =? 16 Frame size =? 4KB # of frames =? 8 Converting
More informationCache Performance and Memory Management: From Absolute Addresses to Demand Paging. Cache Performance
6.823, L11--1 Cache Performance and Memory Management: From Absolute Addresses to Demand Paging Asanovic Laboratory for Computer Science M.I.T. http://www.csg.lcs.mit.edu/6.823 Cache Performance 6.823,
More informationVirtual Memory. Daniel Sanchez Computer Science & Artificial Intelligence Lab M.I.T. April 12, 2018 L16-1
Virtual Memory Daniel Sanchez Computer Science & Artificial Intelligence Lab M.I.T. L16-1 Reminder: Operating Systems Goals of OS: Protection and privacy: Processes cannot access each other s data Abstraction:
More informationOpenVMS Information Desk
The Sequel OpenVMS Information Desk Free Advice Worth Every Cent Thilo Lauer Hewlett Packard GmbH Manfred Kaser Hewlett Packard GmbH Disclaimers There's no sense in being precise when you don't even know
More informationVirtual Memory 1. Virtual Memory
Virtual Memory 1 Virtual Memory key concepts virtual memory, physical memory, address translation, MMU, TLB, relocation, paging, segmentation, executable file, swapping, page fault, locality, page replacement
More informationVirtual Memory 1. Virtual Memory
Virtual Memory 1 Virtual Memory key concepts virtual memory, physical memory, address translation, MMU, TLB, relocation, paging, segmentation, executable file, swapping, page fault, locality, page replacement
More informationLecture 10: Cache Coherence: Part I. Parallel Computer Architecture and Programming CMU , Spring 2013
Lecture 10: Cache Coherence: Part I Parallel Computer Architecture and Programming Cache design review Let s say your code executes int x = 1; (Assume for simplicity x corresponds to the address 0x12345604
More informationCOSC3330 Computer Architecture Lecture 20. Virtual Memory
COSC3330 Computer Architecture Lecture 20. Virtual Memory Instructor: Weidong Shi (Larry), PhD Computer Science Department University of Houston Virtual Memory Topics Reducing Cache Miss Penalty (#2) Use
More informationMEMORY MANAGEMENT/1 CS 409, FALL 2013
MEMORY MANAGEMENT Requirements: Relocation (to different memory areas) Protection (run time, usually implemented together with relocation) Sharing (and also protection) Logical organization Physical organization
More informationVirtual Memory. Motivations for VM Address translation Accelerating translation with TLBs
Virtual Memory Today Motivations for VM Address translation Accelerating translation with TLBs Fabián Chris E. Bustamante, Riesbeck, Fall Spring 2007 2007 A system with physical memory only Addresses generated
More informationCS 152 Computer Architecture and Engineering. Lecture 9 - Address Translation
CS 152 Computer Architecture and Engineering Lecture 9 - Address Translation Krste Asanovic Electrical Engineering and Computer Sciences University of California at Berkeley http://www.eecs.berkeley.edu/~krste!
More informationCache Memory COE 403. Computer Architecture Prof. Muhamed Mudawar. Computer Engineering Department King Fahd University of Petroleum and Minerals
Cache Memory COE 403 Computer Architecture Prof. Muhamed Mudawar Computer Engineering Department King Fahd University of Petroleum and Minerals Presentation Outline The Need for Cache Memory The Basics
More informationPrinceton University. Computer Science 217: Introduction to Programming Systems. The Memory/Storage Hierarchy and Virtual Memory
Princeton University Computer Science 27: Introduction to Programming Systems The Memory/Storage Hierarchy and Virtual Memory Goals of this Lecture Help you learn about: Locality and caching The memory
More informationCS 153 Design of Operating Systems Winter 2016
CS 153 Design of Operating Systems Winter 2016 Lecture 16: Memory Management and Paging Announcement Homework 2 is out To be posted on ilearn today Due in a week (the end of Feb 19 th ). 2 Recap: Fixed
More informationComputer Architecture. Memory Hierarchy. Lynn Choi Korea University
Computer Architecture Memory Hierarchy Lynn Choi Korea University Memory Hierarchy Motivated by Principles of Locality Speed vs. Size vs. Cost tradeoff Locality principle Temporal Locality: reference to
More informationMemory latency: Affects cache miss penalty. Measured by:
Main Memory Main memory generally utilizes Dynamic RAM (DRAM), which use a single transistor to store a bit, but require a periodic data refresh by reading every row. Static RAM may be used for main memory
More informationCS 152 Computer Architecture and Engineering. Lecture 8 - Address Translation
CS 152 Computer Architecture and Engineering Lecture 8 - Translation Krste Asanovic Electrical Engineering and Computer Sciences University of California at Berkeley http://www.eecs.berkeley.edu/~krste!
More informationMemory latency: Affects cache miss penalty. Measured by:
Main Memory Main memory generally utilizes Dynamic RAM (DRAM), which use a single transistor to store a bit, but require a periodic data refresh by reading every row. Static RAM may be used for main memory
More informationvirtual memory Page 1 CSE 361S Disk Disk
CSE 36S Motivations for Use DRAM a for the Address space of a process can exceed physical memory size Sum of address spaces of multiple processes can exceed physical memory Simplify Management 2 Multiple
More informationOperating System Support
William Stallings Computer Organization and Architecture 10 th Edition Edited by Dr. George Lazik + Chapter 8 Operating System Support Application programming interface Application binary interface Instruction
More informationMemory Management. Dr. Yingwu Zhu
Memory Management Dr. Yingwu Zhu Big picture Main memory is a resource A process/thread is being executing, the instructions & data must be in memory Assumption: Main memory is super big to hold a program
More informationEven coarse architectural trends impact tremendously the design of systems
CSE 451: Operating Systems Spring 2006 Module 2 Architectural Support for Operating Systems John Zahorjan zahorjan@cs.washington.edu 534 Allen Center Even coarse architectural trends impact tremendously
More informationRandom-Access Memory (RAM) Systemprogrammering 2007 Föreläsning 4 Virtual Memory. Locality. The CPU-Memory Gap. Topics
Systemprogrammering 27 Föreläsning 4 Topics The memory hierarchy Motivations for VM Address translation Accelerating translation with TLBs Random-Access (RAM) Key features RAM is packaged as a chip. Basic
More informationComputer Science 146. Computer Architecture
Computer Architecture Spring 2004 Harvard University Instructor: Prof. dbrooks@eecs.harvard.edu Lecture 18: Virtual Memory Lecture Outline Review of Main Memory Virtual Memory Simple Interleaving Cycle
More informationand data combined) is equal to 7% of the number of instructions. Miss Rate with Second- Level Cache, Direct- Mapped Speed
5.3 By convention, a cache is named according to the amount of data it contains (i.e., a 4 KiB cache can hold 4 KiB of data); however, caches also require SRAM to store metadata such as tags and valid
More informationVirtual Memory. CS 3410 Computer System Organization & Programming
Virtual Memory CS 3410 Computer System Organization & Programming These slides are the product of many rounds of teaching CS 3410 by Professors Weatherspoon, Bala, Bracy, and Sirer. Where are we now and
More informationMemory Management. Dr. Yingwu Zhu
Memory Management Dr. Yingwu Zhu Big picture Main memory is a resource A process/thread is being executing, the instructions & data must be in memory Assumption: Main memory is infinite Allocation of memory
More informationCIS Operating Systems Memory Management Address Translation for Paging. Professor Qiang Zeng Spring 2018
CIS 3207 - Operating Systems Memory Management Address Translation for Paging Professor Qiang Zeng Spring 2018 Previous class What is logical address? Who use it? Describes a location in the logical memory
More informationRandom-Access Memory (RAM) Systemprogrammering 2009 Föreläsning 4 Virtual Memory. Locality. The CPU-Memory Gap. Topics! The memory hierarchy
Systemprogrammering 29 Föreläsning 4 Topics! The memory hierarchy! Motivations for VM! Address translation! Accelerating translation with TLBs Random-Access (RAM) Key features! RAM is packaged as a chip.!
More informationPipelined processors and Hazards
Pipelined processors and Hazards Two options Processor HLL Compiler ALU LU Output Program Control unit 1. Either the control unit can be smart, i,e. it can delay instruction phases to avoid hazards. Processor
More informationCS 152 Computer Architecture and Engineering. Lecture 9 - Address Translation
CS 152 Computer Architecture and Engineering Lecture 9 - Address Translation Krste Asanovic Electrical Engineering and Computer Sciences University of California at Berkeley http://www.eecs.berkeley.edu/~krste
More informationTO :- VMS Champions. SUBJECT:- VMS update #3 : Apr 2011
TO :- VMS Champions SUBJECT:- VMS update #3 : Apr 2011 This is our third issue of OpenVMS update brought to you by OpenVMS customer programs office. Our endeavor is to give information that will be useful
More informationMEMORY MANAGEMENT UNITS
Memory Management Units memory management unit (MMU) simply converts a virtual address generated by a CPU into a physical address which is applied to the memory system address space divided into fixed
More informationCarnegie Mellon. 16 th Lecture, Mar. 20, Instructors: Todd C. Mowry & Anthony Rowe
Virtual Memory: Concepts 5 23 / 8 23: Introduction to Computer Systems 6 th Lecture, Mar. 2, 22 Instructors: Todd C. Mowry & Anthony Rowe Today Address spaces VM as a tool lfor caching VM as a tool for
More informationEE 457 Unit 7b. Main Memory Organization
1 EE 457 Unit 7b Main Memory Organization 2 Motivation Organize main memory to Facilitate byte-addressability while maintaining Efficient fetching of the words in a cache block Low order interleaving (L.O.I)
More informationVirtual Memory Oct. 29, 2002
5-23 The course that gives CMU its Zip! Virtual Memory Oct. 29, 22 Topics Motivations for VM Address translation Accelerating translation with TLBs class9.ppt Motivations for Virtual Memory Use Physical
More informationVirtual Memory. Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University
Virtual Memory Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University Precise Definition of Virtual Memory Virtual memory is a mechanism for translating logical
More informationCS 152 Computer Architecture and Engineering. Lecture 11 - Virtual Memory and Caches
CS 152 Computer Architecture and Engineering Lecture 11 - Virtual Memory and Caches Krste Asanovic Electrical Engineering and Computer Sciences University of California at Berkeley http://www.eecs.berkeley.edu/~krste
More informationIndependent consultant. (Ex-) Oracle ACE Director. Member of OakTable Network. Performance Troubleshooting In-house workshops
Independent consultant Performance Troubleshooting In-house workshops Cost-Based Optimizer Performance By Design (Ex-) Oracle ACE Director 2009-2016 Alumni Member of OakTable Network http://oracle-randolf.blogspot.com
More informationMain Memory (II) Operating Systems. Autumn CS4023
Operating Systems Autumn 2017-2018 Outline 1 Main Memory (II) Outline Main Memory (II) 1 Main Memory (II) Paging Main Memory (II) Physical address space of a process can be noncontiguous; process is allocated
More informationLecture 19: Virtual Memory: Concepts
CSCI-UA.2-3 Computer Systems Organization Lecture 9: Virtual Memory: Concepts Mohamed Zahran (aka Z) mzahran@cs.nyu.edu http://www.mzahran.com Some slides adapted (and slightly modified) from: Clark Barrett
More informationComputer Systems. Virtual Memory. Han, Hwansoo
Computer Systems Virtual Memory Han, Hwansoo A System Using Physical Addressing CPU Physical address (PA) 4 Main memory : : 2: 3: 4: 5: 6: 7: 8:... M-: Data word Used in simple systems like embedded microcontrollers
More informationCS152 Computer Architecture and Engineering
CS152 Computer Architecture and Engineering Caches and the Memory Hierarchy Assigned 9/17/2016 Problem Set #2 Due Tue, Oct 4 http://inst.eecs.berkeley.edu/~cs152/fa16 The problem sets are intended to help
More informationReducing Hit Times. Critical Influence on cycle-time or CPI. small is always faster and can be put on chip
Reducing Hit Times Critical Influence on cycle-time or CPI Keep L1 small and simple small is always faster and can be put on chip interesting compromise is to keep the tags on chip and the block data off
More informationVirtual Memory. Physical Addressing. Problem 2: Capacity. Problem 1: Memory Management 11/20/15
Memory Addressing Motivation: why not direct physical memory access? Address translation with pages Optimizing translation: translation lookaside buffer Extra benefits: sharing and protection Memory as
More informationOutline. Low-Level Optimizations in the PowerPC/Linux Kernels. PowerPC Architecture. PowerPC Architecture
Low-Level Optimizations in the PowerPC/Linux Kernels Dr. Paul Mackerras Senior Technical Staff Member IBM Linux Technology Center OzLabs Canberra, Australia paulus@samba.org paulus@au1.ibm.com Introduction
More informationNew-School Machine Structures. Overarching Theme for Today. Agenda. Review: Memory Management. The Problem 8/1/2011
CS 61C: Great Ideas in Computer Architecture (Machine Structures) Virtual Instructor: Michael Greenbaum 1 New-School Machine Structures Software Parallel Requests Assigned to computer e.g., Search Katz
More informationOpenVMS Technical Journal V9
OpenVMS Technical Journal V9 Methodologies for Fixing Alignment Faults Ajo Jose Panoor, OpenVMS DECnet Engineering Overview The OpenVMS operating system is one of HP s key operating systems and has been
More informationComputer Architecture Memory hierarchies and caches
Computer Architecture Memory hierarchies and caches S Coudert and R Pacalet January 23, 2019 Outline Introduction Localities principles Direct-mapped caches Increasing block size Set-associative caches
More informationMemory Hierarchy. Slides contents from:
Memory Hierarchy Slides contents from: Hennessy & Patterson, 5ed Appendix B and Chapter 2 David Wentzlaff, ELE 475 Computer Architecture MJT, High Performance Computing, NPTEL Memory Performance Gap Memory
More informationCS162 - Operating Systems and Systems Programming. Address Translation => Paging"
CS162 - Operating Systems and Systems Programming Address Translation => Paging" David E. Culler! http://cs162.eecs.berkeley.edu/! Lecture #15! Oct 3, 2014!! Reading: A&D 8.1-2, 8.3.1. 9.7 HW 3 out (due
More informationVirtual Memory Virtual memory first used to relive programmers from the burden of managing overlays.
CSE420 Virtual Memory Prof. Mokhtar Aboelaze York University Based on Slides by Prof. L. Bhuyan (UCR) Prof. M. Shaaban (RIT) Virtual Memory Virtual memory first used to relive programmers from the burden
More informationStorage Management 1
Storage Management Goals of this Lecture Help you learn about: Locality and caching Typical storage hierarchy Virtual memory How the hardware and OS give applications the illusion of a large, contiguous,
More informationModule Outline. CPU Memory interaction Organization of memory modules Cache memory Mapping and replacement policies.
M6 Memory Hierarchy Module Outline CPU Memory interaction Organization of memory modules Cache memory Mapping and replacement policies. Events on a Cache Miss Events on a Cache Miss Stall the pipeline.
More information2-Level Page Tables. Virtual Address Space: 2 32 bytes. Offset or Displacement field in VA: 12 bits
-Level Page Tables Virtual Address (VA): bits Offset or Displacement field in VA: bits Virtual Address Space: bytes Page Size: bytes = KB Virtual Page Number field in VA: - = bits Number of Virtual Pages:
More informationChapter 5. Large and Fast: Exploiting Memory Hierarchy
Chapter 5 Large and Fast: Exploiting Memory Hierarchy Memory Technology Static RAM (SRAM) 0.5ns 2.5ns, $2000 $5000 per GB Dynamic RAM (DRAM) 50ns 70ns, $20 $75 per GB Magnetic disk 5ms 20ms, $0.20 $2 per
More informationCache Performance (H&P 5.3; 5.5; 5.6)
Cache Performance (H&P 5.3; 5.5; 5.6) Memory system and processor performance: CPU time = IC x CPI x Clock time CPU performance eqn. CPI = CPI ld/st x IC ld/st IC + CPI others x IC others IC CPI ld/st
More informationVirtual Memory. Reading. Sections 5.4, 5.5, 5.6, 5.8, 5.10 (2) Lecture notes from MKP and S. Yalamanchili
Virtual Memory Lecture notes from MKP and S. Yalamanchili Sections 5.4, 5.5, 5.6, 5.8, 5.10 Reading (2) 1 The Memory Hierarchy ALU registers Cache Memory Memory Memory Managed by the compiler Memory Managed
More information@2010 Badri Computer Architecture Assembly II. Virtual Memory. Topics (Chapter 9) Motivations for VM Address translation
Virtual Memory Topics (Chapter 9) Motivations for VM Address translation 1 Motivations for Virtual Memory Use Physical DRAM as a Cache for the Disk Address space of a process can exceed physical memory
More informationECE 411 Exam 1 Practice Problems
ECE 411 Exam 1 Practice Problems Topics Single-Cycle vs Multi-Cycle ISA Tradeoffs Performance Memory Hierarchy Caches (including interactions with VM) 1.) Suppose a single cycle design uses a clock period
More information