ITFN 2601 Introduction to Operating Systems Lecture 16 Segmentation.

Slides:



Advertisements
Similar presentations
Memory.
Advertisements

Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 36 Virtual Memory Read.
Memory Management Paging &Segmentation CS311, CS350 & CS550.
MODERN OPERATING SYSTEMS Third Edition ANDREW S. TANENBAUM Chapter 3 Memory Management Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall,
Operating Systems Operating Systems - Winter 2009 Chapter 4 – Memory Management Vrije Universiteit Amsterdam.
Paging Hardware With TLB
4/14/2017 Discussed Earlier segmentation - the process address space is divided into logical pieces called segments. The following are the example of types.
CSC 322 Operating Systems Concepts Lecture - 18: by Ahmed Mumtaz Mustehsan Special Thanks To: Tanenbaum, Modern Operating Systems 3 e, (c) 2008 Prentice-Hall,
CMPT 300: Final Review Chapters 8 – Memory Management: Ch. 8, 9 Address spaces Logical (virtual): generated by the CPU Physical: seen by the memory.
Memory Management Design & Implementation Segmentation Chapter 4.
CS 333 Introduction to Operating Systems Class 12 - Virtual Memory (2) Jonathan Walpole Computer Science Portland State University.
CS 333 Introduction to Operating Systems Class 12 - Virtual Memory (2) Jonathan Walpole Computer Science Portland State University.
CS 333 Introduction to Operating Systems Class 12 - Virtual Memory (2) Jonathan Walpole Computer Science Portland State University.
Chapter 10 – Virtual Memory Organization Outline 10.1 Introduction 10.2Virtual Memory: Basic Concepts 10.3Block Mapping 10.4Paging Paging Address.
Memory Management (II)
1 Pertemuan 16 Isu-Isu pada Sistem Paging dan Segmentasi Matakuliah: T0316/sistem Operasi Tahun: 2005 Versi/Revisi: 5.
CMPT 300: Final Review Chapters 8 – Memory Management: Ch. 8, 9 Address spaces Logical (virtual): generated by the CPU Physical: seen by the memory.
Chapter 3.2 : Virtual Memory
Memory Management (continued) CS-3013 C-term Memory Management CS-3013 Operating Systems C-term 2008 (Slides include materials from Operating System.
9.9.2 Memory Placement Strategies Where to put incoming processes –First-fit strategy Process placed in first hole of sufficient size found Simple, low.
Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The Operating System Machine.
Chapter 91 Translation Lookaside Buffer (described later with virtual memory) Frame.
Silberschatz, Galvin and Gagne  Operating System Concepts Segmentation Memory-management scheme that supports user view of memory. A program.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts, Amherst Operating Systems CMPSCI 377 Lecture.
03/17/2008CSCI 315 Operating Systems Design1 Virtual Memory Notice: The slides for this lecture have been largely based on those accompanying the textbook.
Chapter 3 Memory Management 3.7 Segmentation. A compiler has many tables that are built up as compilation proceeds, possibly including: The source text.
CS 333 Introduction to Operating Systems Class 12 - Virtual Memory (2) Jonathan Walpole Computer Science Portland State University.
Segmentation CS 537 – Introduction to Operating Systems.
ITEC 325 Lecture 29 Memory(6). Review P2 assigned Exam 2 next Friday Demand paging –Page faults –TLB intro.
CS333 Intro to Operating Systems Jonathan Walpole.
Cosc 3P92 Week 9 & 10 Lecture slides
Operating Systems Chapter 8
Computer Architecture Lecture 5: Addressing modes Piotr Bilski.
Segmentation & O/S Input/Output Chapter 4 & 5 Tuesday, April 3, 2007.
Memory Management 3 Tanenbaum Ch. 3 Silberschatz Ch. 8,9.
1 Chapter 3.2 : Virtual Memory What is virtual memory? What is virtual memory? Virtual memory management schemes Virtual memory management schemes Paging.
Page 110/20/2015 CSE 30341: Operating Systems Principles So far…  Page  Fixed size pages solve page allocation problem (and external fragmentation) 
1 Memory Management 4.1 Basic memory management 4.2 Swapping 4.3 Virtual memory 4.4 Page replacement algorithms 4.5 Modeling page replacement algorithms.
Page 1 2P13 Week 5. Page 2 Page 3 Page 4 Page 5.
CE Operating Systems Lecture 14 Memory management.
Virtual Memory. Background Virtual memory is a technique that allows execution of processes that may not be completely in the physical memory. Virtual.
Chapter 4 Memory Management Segmentation. (a) One address space. (b) Separate I and D spaces. Separate Instruction and Data Spaces.
Operating Systems Lecture 14 Segments Adapted from Operating Systems Lecture Notes, Copyright 1997 Martin C. Rinard. Zhiqing Liu School of Software Engineering.
9.1 Operating System Concepts Paging Example. 9.2 Operating System Concepts.
操作系统原理 OPERATING SYSTEM Chapter 3 Memory Management 内存管理.
Lecture 19 Virtual Memory Demand Paging. Background Virtual memory – separation of user logical memory from physical memory. –Only part of the program.
Address Translation Andy Wang Operating Systems COP 4610 / CGS 5765.
Page Replacement Implementation Issues Text: –Tanenbaum ch. 4.7.
Address Translation Mark Stanovich Operating Systems COP 4610.
 The MULTICS system solved problems of external fragmentation and lengthy search times by paging the segments  Solution differs from pure segmentation.
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.
Memory Management Paging (continued) Segmentation
CSE 120 Principles of Operating
COMBINED PAGING AND SEGMENTATION
Simple/Basic Segmentation
Page Replacement Implementation Issues
Chapter 8: Main Memory.
Segmentation Lecture November 2018.
Memory Management Paging (continued) Segmentation
Main Memory Background Swapping Contiguous Allocation Paging
The Operating System Machine Level
Page Replacement Implementation Issues
CPSC 457 Operating Systems
Main Memory Session - 16.
Lecture 37 Syed Mansoor Sarwar
Lecture 7: Flexible Address Translation
Lecture 35 Syed Mansoor Sarwar
Memory Management Paging (continued) Segmentation
Operating Systems Chapter 4 – Memory Management
Presentation transcript:

ITFN 2601 Introduction to Operating Systems Lecture 16 Segmentation

Segmentation vs Paging? Paging is incidental Page-data is heterogeneous Statically Sized Segments are intentional Segment data is homogenous Dynamically Sized

Pure Segmentation Segment size varies and changes External Fragmentation Also called “Checkerboarding” Swapping large segments for small Resolution: Compaction

MULTICS Implementation Similar to Multi-Level Paging Address contains Segment # for table Segment table holds Segment Descriptors Descriptor contains page table location Standard Page Table Has 2 18 segments 2 16 Pages With 36-bit entries 2 34 Total Pages

MULTICS Segment Descriptor Page Table address Segment Size Scale and Paged bits

Multics Lookup

Pentium Implementation Local/Global Descriptor Table Local contains program information Global is OS information 3-level Paging (Segment +2-level Virtual) 2 13 Global Local (per Program) Segments 2 14 Total Segments per program 2 32 Pages with 32-bit entries 2 46 Total Pages

Pentium Code Descriptor In-memory System or Application segment Type & Protection (Code/Data) Segment Scale (16-bits or all 32?)

Pentium 2-level Paging

Pentium Protection 2-bit Protection Entry Access granted to all higher levels 00 (0) Can access all 11 (3) Can access 3 Easy to decide access rights Must make paths for system calls