8.1 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Example: The Intel 32 and 64-bit Architectures Dominant industry chips.

Slides:



Advertisements
Similar presentations
Memory Management Paging &Segmentation CS311, CS350 & CS550.
Advertisements

Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 8: Main Memory.
4/14/2017 Discussed Earlier segmentation - the process address space is divided into logical pieces called segments. The following are the example of types.
Chapter 8.3: Memory Management
Memory Management (II)
CE6105 Linux 作業系統 Linux Operating System 許 富 皓. Chapter 2 Memory Addressing.
Memory Management.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 8: Memory-Management Strategies.
Chapter 3.2 : Virtual Memory
Silberschatz, Galvin and Gagne ©2011 Operating System Concepts Essentials– 8 th Edition Chapter 7: Main Memory Rev. by Kyungeun Park, 2015.
8.1 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts with Java – 8 th Edition Chapter 08 Main Memory (Page table questions)
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 8: Main Memory.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 8: Main Memory.
Chapter 8: Main Memory Modified.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 8: Main Memory.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts Essentials – 2 nd Edition Chapter 7: Main Memory.
8.4 paging Paging is a memory-management scheme that permits the physical address space of a process to be non-contiguous. The basic method for implementation.
1 Chapter 3.2 : Virtual Memory What is virtual memory? What is virtual memory? Virtual memory management schemes Virtual memory management schemes Paging.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 34 Paging Implementation.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 9: Memory Management Background Swapping Contiguous Allocation Paging Segmentation.
CS 149: Operating Systems March 10 Class Meeting Department of Computer Science San Jose State University Spring 2015 Instructor: Ron Mak
1 Linux Operating System 許 富 皓. 2 Memory Addressing.
Paging Example What is the data corresponding to the logical address below:
8.1 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Paging Physical address space of a process can be noncontiguous Avoids.
8.1 Silberschatz, Galvin and Gagne ©2005 Operating System Principles Implementation of Page Table Page table is kept in main memory Page-table base.
Memory Management in Pentium Harshad Kasture (01D07033) Saurabh Goyal (01D07035)
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 8: Main Memory.
Introduction to Virtual Memory and Memory Management
8.1 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Objectives To provide a detailed description of various ways of organizing.
Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 8 Main Memory Spring 2015 COMP 4850 Introduction.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 8: Main Memory.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 8: Main Memory.
Chapter 8: Main Memory. 8.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Feb 22, 2005 Memory and Addressing It all starts.
8.1 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Fragmentation External Fragmentation – total memory space exists to satisfy.
Silberschatz, Galvin and Gagne  Operating System Concepts Paging Logical address space of a process can be noncontiguous; process is allocated.
CSE Operating System Principles Memory Management.
COMP 3500 Introduction to Operating Systems Paging: Translation Look-aside Buffers (TLB) Dr. Xiao Qin Auburn University
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 8: Main Memory.
COMP 3500 Introduction to Operating Systems Paging: Basic Method Dr. Xiao Qin Auburn University Slides.
Chapter 8: Main Memory.
Chapter 8: Main Memory.
Chapter 7: Main Memory Rev. by Kyungeun Park, 2017.
Memory Management Paging (continued) Segmentation
Chapter 8: Main Memory Source & Copyright: Operating System Concepts, Silberschatz, Galvin and Gagne.
Chapter 8: Main Memory.
Chapter 9: Main Memory.
Chapter 8: Main Memory.
Chapter 9: Main Memory.
Memory Management Paging (continued) Segmentation
MICROPROCESSOR MEMORY ORGANIZATION
Main Memory Session - 16.
Chapter 8: Main Memory.
Chapter 8: Main Memory.
Chapter 8: Main Memory.
Chapter 8: Main Memory.
Chapter 7: Main Memory.
Chapter 8: Main Memory.
Chapter 8: Memory-Management Strategies
Chapter 8: Main Memory.
Chapter 8: Main Memory.
Chapter 8: Main Memory.
Chapter 8: Main Memory.
Chapter 8: Main Memory.
Chapter 8: Main Memory.
Chapter 8: Main Memory.
Chapter 9: Main Memory.
Chapter 8: Main Memory.
Memory Management Paging (continued) Segmentation
Chapter 8 Main Memory.
Chapter 8: Main Memory.
Presentation transcript:

8.1 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Example: The Intel 32 and 64-bit Architectures Dominant industry chips Pentium CPUs are 32-bit and called IA-32 architecture Current Intel CPUs are 64-bit and called IA-64 architecture Many variations in the chips, cover the main ideas here

8.2 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Example: The Intel IA-32 Architecture Supports both segmentation and segmentation with paging Each segment can be 4 GB Up to 16 K segments per process Divided into two partitions  First partition of up to 8 K segments – private to process – kept in local descriptor table (LDT)  Second partition of up to 8K segments – shared among all processes – kept in global descriptor table (GDT)

8.3 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Example: The Intel IA-32 Architecture (Cont.) CPU generates logical address Selector given to segmentation unit  Which produces linear addresses Linear address given to paging unit  Which generates physical address in main memory  Paging units form equivalent of MMU  Pages sizes can be 4 KB or 4 MB

8.4 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Logical to Physical Address Translation in IA-32

8.5 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Intel IA-32 Segmentation

8.6 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Intel IA-32 Paging Architecture

8.7 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Intel IA-32 Page Address Extensions 32-bit address limits led Intel to create page address extension (PAE), allowing 32-bit apps access to more than 4GB of memory space Paging went to a 3-level scheme Top two bits refer to a page directory pointer table Page-directory and page-table entries moved to 64-bits in size Net effect is increasing address space to 36 bits – 64GB of physical memory

8.8 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Intel x86-64 Current generation Intel x86 architecture 64 bits is ginormous (> 16 exabytes) In practice only implement 48 bit addressing Page sizes of 4 KB, 2 MB, 1 GB Four levels of paging hierarchy Can also use PAE so virtual addresses are 48 bits and physical addresses are 52 bits

8.9 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Example: ARM Architecture Dominant mobile platform chip (Apple iOS and Google Android devices for example) Modern, energy efficient, 32-bit CPU 4 KB and 16 KB pages 1 MB and 16 MB pages (termed sections) One-level paging for sections, two- level for smaller pages Two levels of TLBs Outer level has two micro TLBs (one data, one instruction) Inner is single main TLB First inner is checked, on miss outers are checked, and on miss page table walk performed by CPU

Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition End of Chapter 8