What is the Base register and what is the Limit register?
|
|
- Anna King
- 1 years ago
- Views:
Transcription
1 What is the Base register and what is the Limit register? Base register: Specifies the smallest legal physical memory address. Limit register: Specifies the size of the range. A pair of base and limit registers specifies the logical address space. The base and limit registers can be loaded only by the operating system. Ex: If the base register holds and the limit register is , then the program can legally access all addresses from through (inclusive). What are the different stages in which address binding can occur? Address binding can occur at three different stages: Compile Time: if you know at compile time where the process will reside in memory, then absolute code can be generated. Load Time: if it is not know at compile time where the process will reside in memory, then the compiler must generate relocatable code and the final binding is delayed until the load time. 1
2 Execution Time: if the process can be moved during its execution from one memory segment to another, then binding must be delayed until run time. What are the Logical memory address and the Physical memory address? Logical Memory Address: Addresses generated by the CPU. Physical Memory Address: Addresses seen by the memory unit. Logical and Physical addresses are the same compile-time and loadtime address binding schemes, and differ in the execution-time address-binding scheme. What is the Memory Management Unit (MMU)? Memory Management Unit (MMU): It is a hardware device that maps the logical address to physical address. The value in the MMU relocation register is added to every logical address generated by the CPU to be mapped into a physical memory address. 2
3 What are the different memory management schemes? Memory management schemes: Contiguous Memory Allocation. Non-Contiguous Memory Allocation. Discuss the Memory mapping and protection issue? Memory mapping and protection issue: The main memory is divided into 2 partitions OS space, and user space. The OS space along with the interrupt vector resides in low memory, and the user pace resides in high memory. We need to protect the OS space from mistakenly accessed. We do this by using relocation register together with limit register. The relocation register contains the value of the smallest physical address, and the limit register contains the range of logical address. The value of the logical address must be less than the value in the limit register. 3
4 MMU adds the value in the relocation register to the value in the limit register and send this address to memory. What are the different contiguous memory allocation schemes? There are 3 different contiguous memory allocation schemes: Fixed-size Partitions: the simplest memory allocation schemes in which the memory is partitioned into a set of fixed-length partitions and each partition contains only one process. Multiple-partitions method: When a partition is free, a process is selected from the input queue and loaded into the free partition, and when the process terminates, the partition becomes free. Variable-size partitions: Holes of various sizes are scattered through memory, and when a process arrives it is allocated memory from a hole large enough to accommodate it. The OS maintains information about the allocated partitions and the free partitions. How to solve the problem of dynamic storage allocation? To satisfy a request of size n from a list of free holes, we use one of the following strategies: First-Fit: Allocate the process to the first big enough hole. 4
5 Best-Fit: Allocate the process to the smallest hole that is big enough to accommodate the process. The must search the entire list unless ordered by size and produce the smallest leftover hole. Worst-Fit: Allocate the process to the largest hole. The must search the entire list unless ordered by size and produce the largest leftover hole. What are types of fragmentation? Fragmentation can be one of the following: External Fragmentation: Total memory space exists to satisfy a request but is not contiguous. Resulted from best-fit and first-fit. Internal Fragmentation: Allocated memory may be slightly larger than the required memory resulted in a size difference that is memory internal to a partition but is not used. The general approach to avoiding external fragmentation is to break the physical memory into fixed-sized blocks and allocate memory in units based on block size. How to reduce the external fragmentation? To reduce the external fragmentation by: Compaction: Shuffle memory contents to place all free memory together in one large block. It is possible only if relocation is dynamic, and is done at execution time. Another possible solution: paging and segmentation. What are the types of Non-contiguous Memory allocation? Non-Contiguous Memory Allocation: Paging. Segments. Segments with paging. 5
6 What is paging? Paging: It is a memory management scheme that permits the physical address space of a process to be non-contiguous. Divides the physical memory into fixed-length blocks called frames and each frame size is of power 2 from 512 bytes to 16 Mbytes Divides the logical memory into blocks of same size called pages. Each address generated by the CPU is divided into two parts: - Page # (p): It is used as an index to a page table which contains the base address of each page in physical memory. - Page Offset (d): Combined with base address to define the physical memory address that is sent to the memory unit. Logical address generated by the CPU Paging Hardware 6
7 Mapping logical address into physical address What is a page table? And how is it implemented? Page Table: a portion of main memory that maps the page number of a process into its physical frame in memory. It is implemented as follows: - Page Table Base Register (PTBR) points to the page table. - Page Table Length Register (PTLR) indicates the size of page table. In this scheme every data/instruction access requires two memory accesses. One for the page table and one for the data/instruction. What is segmentation? Segmentation: Memory-management scheme that supports user view of memory. A program is a collection of segments. A segment is logical unit such as (main program, procedure, method, object, local variables, global variables, common block ). Logical address consists of a two tuple <segment-number, offset>. 7
8 Logical view of segmentation What is the segment table? And how is it implemented? Segment Table: maps two-dimensional physical addresses; each table entry has: - Base: contains the starting physical address where the segments reside in memory. - Limit: specifies the length of the segment. It is implemented as: - Segment Table Base Register (STBR): points to the segment table s location in memory. - Segment Table Length Register (STLR): indicates the number of segments used by a program. 8
9 What are the types of memory? Memory types: Segmentation Hardware Real Memory: Main Memory. Virtual Memory: Memory on disk. What is a virtual memory? Virtual Memory: Involves separation of user logical memory from physical memory. Simulating more random access memory (RAM) than actually exists, allowing the computer to run larger programs and multiple programs concurrently. A common function in most every OS and hardware platform, virtual memory uses the hard disk to temporarily hold what was in real memory. It can be implemented as: - Demand paging. - Demand segmentation. 9
Background. Memory Management. Base and Limit Registers. Binding of Instructions and Data to Memory. Logical vs. Physical Address Space
Background Memory Management Program must be brought (from disk) into memory and placed within a process for it to be run Main memory and registers are only storage CPU can access directly Register access
Chapter 9: Memory Management. Background
Chapter 9: Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 9.1 Background Program must be brought into memory and placed within a process for it
8.1 Background. Base and Limit Registers. Chapter 8: Memory-Management Management Strategies. Objectives
Chapter 8: Memory-Management Management Strategies Objectives To provide a detailed description of various ways of organizing memory hardware To discuss various memory-management techniques, including
Operating Systems Concepts
Operating Systems Concepts MODULE 7: MEMORY MANAGEMENT Andrzej Bednarski, Ph.D. student Department of Computer and Information Science Linköping University, Sweden E-mail: andbe@ida.liu.se URL: http://www.ida.liu.se/~andbe
Chapter 8: Memory Management!
The image cannot be displayed. Your computer may not have enough memory to open the image, or the image may have been corrupted. Restart your computer, and then open the file again. If the red x still
OS - Memory Management
OS - Memory Management Memory management is the functionality of an operating system which handles or manages primary memory. Memory management keeps track of each and every memory location either it is
Agenda. Memory Management. Binding of Instructions and Data to Memory. Background. CSCI 444/544 Operating Systems Fall 2008
Agenda Background Memory Management CSCI 444/544 Operating Systems Fall 2008 Address space Static vs Dynamic allocation Contiguous vs non-contiguous allocation Background Program must be brought into memory
Memory Management Outline. Background Swapping Contiguous Memory Allocation Paging Segmentation Segmented Paging
Memory Management Outline Background Swapping Contiguous Memory Allocation Paging Segmentation Segmented Paging 1 Background Memory is a large array of bytes memory and registers are only storage CPU can
Memory Management (Ch.9)
Memory Management (Ch.9)! Background! Address Binding - Linking and Loading! Swapping! Memory Protection! Contiguous Memory Allocation! Paging! Segmentation! Combined Paging and Segmentation Silberschatz
Goals of Memory Management
Memory Management Goals of Memory Management Allocate available memory efficiently to multiple processes Main functions Allocate memory to processes when needed Keep track of what memory is used and what
CH 7. MAIN MEMORY. Base and Limit Registers. Memory-Management Unit (MMU) Chapter 7: Memory Management. Background. Logical vs. Physical Address Space
Chapter 7: Memory Management CH 7. MAIN MEMORY Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation adapted from textbook slides Background Base and Limit Registers
Chapter 9: Memory Management
Chapter 9: Memory Management Background Logical versus Physical Address Space Overlays versus Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging Operating System Concepts 9.1 Background
Lecture 4: Memory Management
Lecture 4: Memory Management Background Program must be brought into memory and placed within a process for it to be run Input queue collection of processes on the disk that are waiting to be brought into
Chapter 8: Memory Management
Chapter 8: Memory Management Chapter 8: Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 8.2 Memory Management Examine basic (not virtual) memory
Virtual Memory & Memory Management
CS 571 Operating Systems Virtual Memory & Memory Management Angelos Stavrou, George Mason University Memory Management 2 Logical and Physical Address Spaces Contiguous Allocation Paging Segmentation Virtual
The Deadlock Problem. Deadlocks. Deadlocks. Bridge Crossing Example
The Deadlock Problem Deadlocks A set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set. Example System has 2 tape drives. P 1 and P 2 each
Operating Systems Memory Management
Operating Systems Memory Management ECE 344 ECE 344 Operating Systems 1 Memory Management Contiguous Memory Allocation Paged Memory Management Virtual Memory ECE 344 Operating Systems 2 Binding of Instructions
Memory Management. Main memory Virtual memory
Memory Management Main memory Virtual memory Main memory Background (1) Processes need to share memory Instruction execution cycle leads to a stream of memory addresses Basic hardware CPU can only access
OPERATING SYSTEM - MEMORY MANAGEMENT
OPERATING SYSTEM - MEMORY MANAGEMENT http://www.tutorialspoint.com/operating_system/os_memory_management.htm Copyright tutorialspoint.com Memory management is the functionality of an operating system which
Contiguous Allocation. Contiguous Allocation. Free List. Dynamic Storage-Allocation Problem. Fragmentation
Contiguous Allocation Main memory usually into two partitions: Resident operating system, usually held in low memory with interrupt vector. User processes then held in high memory. Memory Management --
Basic Memory Management
Basic Memory Management Basic Memory Management CS 256/456 Dept. of Computer Science, University of Rochester Program must be brought into memory and placed within a process for it to be run. Mono-ming
1. Background. Chapter 8: Main Memory. Background (cont) Chapter 8: Memory Management
Chapter 8: Main Memory 1. Background Typical instruction/execution cycle Fetches an instruction from memory Decode Operand fetched from memory Result stored back in memory Memory units see ONLY a stream
Operating Systems. Memory Management. Lecture 9 Michael O Boyle
Operating Systems Memory Management Lecture 9 Michael O Boyle 1 Chapter 8: Memory Management Background Logical/Virtual Address Space vs Physical Address Space Swapping Contiguous Memory Allocation Segmentation
Memory Management. Reading: Silberschatz chapter 9 Reading: Stallings. chapter 7 EEL 602
Memory Management Reading: Silberschatz chapter 9 Reading: Stallings chapter 7 1 Outline Background Issues in Memory Management Logical Vs Physical address, MMU Dynamic Loading Memory Partitioning Placement
III. Memory Management, Virtual Memory
TDIU25: Operating Systems III. Memory Management, Virtual Memory SGG9: chapters 8 and 9 o Memory management: o contiguous allocation, fragmentation, segmentation, paging o Virtual memory: o demand paging,
Computer Systems Engineering Department, QUEST, Nawabshah OPERATING SYSTEMS
OPERATING SYSTEMS Memory Management Introduction Fixed Partitioning Variable Partitioning Memory Hole/Allocation management Problems Introduction Techniques to manage Main memory efficiently Provides multitasking
Learning Outcomes. Memory Management
Learning Outcomes Memory Management Appreciate the need for memory management in operating systems, understand the limits of fixed memory allocation schemes. Understand fragmentation in dynamic memory
PROJECT REPORT MEMORY MANAGEMENT DATE :
PROJECT REPORT MEMORY MANAGEMENT DATE : GROUP MEMBERS: MEMORY MANAGEMENT PURPOSE: To simulate memory management of a simple system in order to better comprehend the complex memory management system of
Memory management basics (1) Requirements (1) Objectives. Operating Systems Part of E1.9 - Principles of Computers and Software Engineering
Memory management basics (1) Requirements (1) Operating Systems Part of E1.9 - Principles of Computers and Software Engineering Lecture 7: Memory Management I Memory management intends to satisfy the following
Embedded RTOS Memory Management
CS512 Embedded RTOS Embedded RTOS Memory Management C.-Z. Yang http://syslab.cse.yzu.edu.tw/~czyang Background Program must be brought into memory and placed within a process for it to be run. Binding
Announcement. HW#3 will be posted today. Exercise # 4 will be posted on Piazza today.
Announcement HW#3 will be posted today. Exercise # 4 will be posted on Piazza today. Operating Systems: Internals and Design Principles Chapter 7 Memory Management Seventh Edition William Stallings Modified
COSC243 Part 2: Operating Systems
COSC243 Part 2: Operating Systems Lecture 20: Main Memory Management Zhiyi Huang Dept. of Computer Science, University of Otago Zhiyi Huang (Otago) COSC243 Lecture 20 1 / 29 O/S/ course overview Introduction
Memory Management. Memory Management
Memory Management Chapter 7 1 Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated to ensure a reasonable supply of ready processes to consume available processor
Lesson 6: Memory Management & Virtualization
Lesson 6: Memory Management & Virtualization Contents Dynamic allocation, Memory fragmentation Paging Address translation with paging Paging hardware Page table structures Segmentation Virtual memory background
Start of Lecture: March 10, Chapter 8: Main Memory
Start of Lecture: March 10, 2014 1 Reminders Assignment 2 is done! Assignment 3 has been released, due last day of classes Exercise 4 is due on March 18 Paul Lu started talking about memory management
Chapter 7 Memory Management
Operating Systems: Internals and Design Principles Chapter 7 Memory Management Eighth Edition William Stallings Frame Page Segment A fixed-length block of main memory. A fixed-length block of data that
Lectures 21 : Memory Management (ii) Thu 19 Nov 2009
CS211: Programming and Operating Systems Lectures 21 : Memory Management (ii) Thu 19 Nov 2009 CS211 Lectures 21 : Memory Management (ii) 1/23 This afternoon... 1 Recall... Memory management 2 Contiguous
ICS Principles of Operating Systems
ICS 143 - Principles of Operating Systems Operating Systems - Review of content from midterm to final Prof. Ardalan Amiri Sani Prof. Nalini Venkatasubramanian ardalan@uci.edu nalini@ics.uci.edu Deadlocks
CSE 380 Computer Operating Systems. Instructor: Insup Lee. University of Pennsylvania, Fall 2002 Lecture Note: Memory Management.
CSE 380 Computer Operating Systems Instructor: Insup Lee University of Pennsylvania, Fall 2002 Lecture Note: Memory Management 1 Memory Management q The memory management portion of the Operating System
Memory Management Basics
Memory Management Basics 1 Basic Memory Management Concepts Address spaces Physical address space The address space supported by the hardware Starting at address, going to address MAX sys Logical/virtual
Chapter 7 Memory Management
Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 7 Memory Management Dave Bremer Otago Polytechnic, N.Z. 2009, Prentice Hall Roadmap Basic requirements of Memory Management
Chapter 7 Memory Management
Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 7 Memory Management Patricia Roy Manatee Community College, Venice, FL 2008, Prentice Hall Memory Management Subdividing
An Introduction to Memory Management: appendix. Copyright : University of Illinois CS 241 Staff 1
An Introduction to Memory Management: appendix Copyright : University of Illinois CS 241 Staff 1 Memory partitioning Nowadays memory management is based on a sophisticated technique known as (paged) virtual
Address spaces and address binding compile-time load-time run-time Memory management: mapping virtual address to physical addresses
Outline Address spaces and address binding compile-time load-time run-time Memory management: mapping virtual address to physical addresses Paging contiguous allocation and fragmentation paging hardware
Memory Management. In most schemes, the kernel occupies some fixed portion of main memory and the rest is shared by multiple processes
Memory Management Is the task carried out by the OS and hardware to accommodate multiple processes in main memory If only a few processes can be kept in main memory, then much of the time all processes
Section I Section Real Time Systems. Processes. 1.7 Memory Management. (Textbook: A. S. Tanenbaum Modern OS - ch. 3) Memory Management Introduction
EE206: Software Engineering IV 1.7 Memory Management page 1 of 28 Section I Section Real Time Systems. Processes 1.7 Memory Management (Textbook: A. S. Tanenbaum Modern OS - ch. 3) Memory Management Introduction
Paging & Segmentation
& Frédéric Haziza Department of Computer Systems Uppsala University Spring 2007 Outline 1 Paging Implementation Protection Sharing 2 Setup Implementation Definition Paging Memory-management
CHAPTER 8 Exercises 8.1 Answer: 8.2 Answer: 8.3 Answer:
CHAPTER 8 Although many systems are demand paged (discussed in Chapter 12), there are still many that are not, and in many cases the simpler memory-management strategies may be better, especially for small
Introduction to Paging
Introduction to Paging Readings Silberschatz: 8.2, 8.4 Outline Introduction to Paging Concepts Introduction Previous memory schemes were characterized by Need for compaction External fragmentation Paging
Outline. V Computer Systems Organization II (Honors) (Introductory Operating Systems) (Review) Memory Management
Outline V22.0202-001 Computer Systems Organization II (Honors) (Introductory Operating Systems) Lecture 14 Memory Management March 28, 2005 Announcements Lab 4 due next Monday (April 4 th ) demos on 4
Memory Management: Main Memory
Memory Management: Main Memory It s all about bookkeeping The von Neumann model: fetch instructions from memory; decode instructions; possibly read or write data to or from memory; rinse and repeat In
Memory Management and Paging. CSCI 3753 Operating Systems Spring 2005 Prof. Rick Han
Memory Management and Paging CSCI 3753 Operating Systems Spring 2005 Prof. Rick Han Announcements PA #2 due Friday March 18 11:55 pm - note extension of a day Read chapters 11 and 12 From last time...
4 Main Memory Management
4 Main Memory Management 4.1 Introduction A large part of the OS s responsibility is organising main memory for processes. GOAL pack as many processes into memory as possible so that the processor will
3. Memory Management
Principles of Operating Systems CS 446/646 3. Memory Management René Doursat Department of Computer Science & Engineering University of Nevada, Reno Spring 2006 Principles of Operating Systems CS 446/646
Main Memory. Memory. Address binding. Memory spaces. All processes need main memory.
Memory If we define memory as a place where data is stored there are many levels of memory: Processor registers Primary (or main) memory RAM Secondary memory slower and more permanent disks Tertiary memory
Memory unit sees only the addresses, and not how they are generated (instruction counter, indexing, direct)
Memory Management 55 Memory Management Multitasking without memory management is like having a party in a closet. Charles Petzold. Programming Windows 3.1 Programs expand to fill the memory that holds
PROCESS VIRTUAL MEMORY. CS124 Operating Systems Winter , Lecture 18
PROCESS VIRTUAL MEMORY CS124 Operating Systems Winter 2013-2014, Lecture 18 2 Programs and Memory Programs perform many interactions with memory Accessing variables stored at specific memory locations
OPERATING SYSTEMS MEMORY MANAGEMENT
OPERATING SYSTEMS MEMORY MANAGEMENT Jerry Breecher 8: Memory Management 1 OPERATING SYSTEM Memory Management What Is In This Chapter? Just as processes share the CPU, they also share physical memory. This
William Stallings Computer Organization and Architecture
William Stallings Computer Organization and Architecture Chapter 8 Operating System Support Rev. 3.2 (2009-10) by Enrico Nardelli 8-1 Objectives and Functions Convenience Making the computer easier to
MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR
STUDENT IDENTIFICATION NO MULTIMEDIA COLLEGE JALAN GURNEY KIRI 54100 KUALA LUMPUR FIRST, SECOND, THIRD SEMESTER FINAL EXAMINATION, 2014/2015 SESSION ITC2053/TIS2233 OPERATING SYSTEM DSEWE-F-2-/14, DSEW-E-F-1/14,
LOGICAL AND PHYSICAL ORGANIZATION MEMORY MANAGEMENT TECHNIQUES (CONT D)
MEMORY MANAGEMENT Requirements: Relocation (to different memory areas) Protection (run time, usually implemented together with relocation) Sharing (and also protection) Logical organization Physical organization
CSE 513 Introduction to Operating Systems. Class 7 - Virtual Memory (2)
CSE 513 Introduction to Operating Systems Class 7 - Virtual Memory (2) Jonathan Walpole Dept. of Comp. Sci. and Eng. Oregon Health and Science University Key memory management issues Utilization Programmability
Module 4: Memory Management
Module 4: Memory Management The von Neumann principle for the design and operation of computers requires that a program has to be primary memory resident to execute. Also, a user requires to revisit his
Memory Management. Prof. P.C.P. Bhatt. P.C.P Bhat OS/M4/V1/2004 1
Memory Management Prof. P.C.P. Bhatt P.C.P Bhat OS/M4/V1/2004 1 What is a Von-Neumann Architecture? Von Neumann computing requires a program to reside in main memory to run. Motivation The main motivation
Last Class: Memory Management. Today: Paging
Last Class: Memory Management Uniprogramming Static Relocation Dynamic Relocation Lecture 15, page 1 Today: Paging Processes typically do not use their entire space in memory all the time. Paging 1. divides
Chapter 2 Memory Management: Early Systems. Understanding Operating Systems, Fourth Edition
Chapter 2 Memory Management: Early Systems Understanding Operating Systems, Fourth Edition Memory Management: Early Systems Memory is second only to processes in importance (and in intensity) with which
Memory Management CS 447. Prof. R.K. Joshi Dept of CSE IIT Bombay
Memory Management CS 447 Prof. R.K. Joshi Dept of CSE IIT Bombay Some Simple Memory schemes Some Simple Memory schemes Some Simple Memory schemes Overlays: User level memory management (e.g. TurboPascal)
Virtual and Physical Addresses
Virtual and Physical Addresses Physical addresses are provided by the hardware: one physical address space per machine; valid addresses are usually between 0 and some machinespecific maximum; not all addresses
Objectives and Functions
Objectives and Functions William Stallings Computer Organization and Architecture 6 th Edition Week 10 Operating System Support Convenience Making the computer easier to use Efficiency Allowing better
Goals of memory management. Today s desktop and server systems. Tools of memory management. A trip down Memory Lane
Goals of memory management CSE 451: Operating Systems Spring 212 Module 11 Memory Management Allocate memory resources among competing processes, maximizing memory utilization and system throughput Provide
CSC501 Operating Systems Principles. Memory Management
CSC501 Operating Systems Principles Memory Management 1 Previous Lectures q Linker & Loader q Today Q Memory Management 2 Layer user filesystem inter-machine net. memory mgr (high) device mgr + drivers
OPERATING SYSTEMS
OPERATING SYSTEMS WWW.ANDESTECH.COM TOPICS Page 2 What is an OS? Page 3 Windows Page 4 Linux Page 5 Mac OSX Page 6 What is an OS? Page 7 What is an OS? OS are responsible for everything from starting up
Chapter 3 Memory Management: Virtual Memory
Understanding Operating Systems, Fifth Edition 3-1 Chapter 3 Memory Management: Virtual Memory At a Glance Instructor s Manual Table of Contents Overview Objectives s Quick Quizzes Class Discussion Topics
Memory Management. Today. Next Time. ! Basic memory management! Swapping! Kernel memory allocation. ! Virtual memory
Memory Management Today! Basic memory management! Swapping! Kernel memory allocation Next Time! Virtual memory Memory management! Ideal memory for a programmer Large Fast Non volatile Cheap! Nothing like
7. Memory Management
Lecture Notes for CS347: Operating Systems Mythili Vutukuru, Department of Computer Science and Engineering, IIT Bombay 7. Memory Management 7.1 Basics of Memory Management What does main memory (RAM)
Contiguous Allocation (Cont.)
// CS: Oerating System Lect 9: 5 th Oct Dr. A. Sahu Det of Com. Sc. & Engg. Inian Institute of Technology Guwahati ain emory an emory anagement Relocation & ultile Partition Contiguous Allocation Best
Memory Management. Yücel Saygın. These slides are based on your text book and on the slides prepared by Andrew S. Tanenbaum
Memory Management Yücel Saygın These slides are based on your text book and on the slides prepared by Andrew S. Tanenbaum 1 Memory Management Ideally programmers want memory that is large fast non volatile
8 Memory Management. 8.1 Requirements. 8 Memory Management Protection Relocation INTRODUCTION TO MEMORY MANAGEMENT OPERATING SYSTEMS
OPERATING SYSTEMS INTRODUCTION TO MEMORY MANAGEMENT 1 8 Memory Management In a multiprogramming system, in order to share the processor, a number of processes must be kept in. Memory management is achieved
Topics. Caches and Virtual Memory. Cache Operations. Cache Operations. Write Policies on Cache Hit. Read and Write Policies.
Topics Caches and Virtual Memory CS 333 Fall 2006 Cache Operations Placement strategy Replacement strategy Read and write policy Virtual Memory Why? General overview Lots of terminology Cache Operations
memory management Vaibhav Bajpai
memory management Vaibhav Bajpai OS 2014 motivation virtualize resources: multiplex CPU multiplex memory (CPU scheduling) (memory management) why manage memory? controlled overlap processes should NOT
Memory Management - 1
Memory Management - 1 Memory Management Unit memory is a critical resource efficient use sharing memory management unit Memory Management Unit: Main Aims relocation physical memory assigned to process
Operating Systems, 6 th ed. Test Bank Chapter 7
True / False Questions: Chapter 7 Memory Management 1. T / F In a multiprogramming system, main memory is divided into multiple sections: one for the operating system (resident monitor, kernel) and one
Page 1 of 5. IS 335: Information Technology in Business Lecture Outline Operating Systems
Lecture Outline Operating Systems Objectives Describe the functions and layers of an operating system List the resources allocated by the operating system and describe the allocation process Explain how
Memory Management 1. Memory Management. Multitasking without memory management is like having a party in a closet.
Memory Management 1 Memory Management Multitasking without memory management is like having a party in a closet. Charles Petzold. Programming Windows 3.1 Programs expand to fill the memory that holds them.
Memory and Interrupts
Memory and Interrupts Memory Management Exception/Interrupt Handling Matthias Richly Outline 2 Real-Time & Embedded Memory Management Retro: Classical Approaches Challenges & Requirements Dynamic Allocation
Introduction. Memory Management. Issues in sharing memory. Storage allocation. Transparency
Introduction The CPU fetches instructions and data of a program from memory; therefore, both the program and its data must reside in the main (RAM and ROM) memory. Memory Management Modern multiprogramming
Chapter 8 Memory-Management Strategies Memory Management
Chapter 8 Memory-Management Strategies Memory Management Motivation Keep several processes in memory to improve a system s performance Selection of ifferent memory management methos Application-epenent
Today. Memory management. Memory Management. Computer Hardware Review
Memory management Knut Omang Ifi/Paradial 1 Oct, 2009 (with slides from V. Goebel, C. Griwodz (Ifi/UiO), P. Halvorsen (Ifi/UiO), K. Li (Princeton), A. Tanenbaum (VU Amsterdam), and M. van Steen (VU Amsterdam))
CS5460: Operating Systems
CS5460: Operating Systems Lecture 13: Memory Management (Chapter 8) Where are we? Basic OS structure, HW/SW interface, interrupts, scheduling Concurrency Memory management Storage management Other topics
CS 31: Intro to Systems Virtual Memory. Kevin Webb Swarthmore College April 7, 2015
CS 31: Intro to Systems Virtual Memory Kevin Webb Swarthmore College April 7, 2015 Reading Quiz Memory Abstraction goal: make every process think it has the same memory layout. MUCH simpler for compiler
Lecture 10: Memory Management
Lecture 10: Memory Management CSE 120: Principles of Operating Systems guest starring Amin Vahdat Project 2 Due 11/14 Memory Management Next few lectures are going to cover memory management Goals of memory
& Data Processing 2. Exercise 3: Memory Management. Dipl.-Ing. Bogdan Marin. Universität Duisburg-Essen
Folie a: Name & Data Processing 2 3: Memory Management Dipl.-Ing. Bogdan Marin Fakultät für Ingenieurwissenschaften Abteilung Elektro-und Informationstechnik -Technische Informatik- Objectives Memory Management
W4118 Operating Systems. Instructor: Junfeng Yang
W4118 Operating Systems Instructor: Junfeng Yang Outline Paging Overview Page translation Page allocation Page protection Translation Look-aside Buffers (TLB) Page sharing Page table structure Combining
Wait-For Graph. Exercise. Today. Comp 104: Operating Systems Concepts 27/01/2015. Process Scheduling. Deadlock
Comp 104: Operating Systems Concepts Process Scheduling Today Deadlock Wait-for graphs Detection and recovery Process scheduling Scheduling algorithms First-come, first-served (FCFS) Shortest Job First
One of the most difficult aspects of operating system design is memory management.
M07_STAL6329_06_SE_C07.QXD 2/21/08 9:30 PM Page 309 PART THREE Memory One of the most difficult aspects of operating system design is memory management. Although the cost of memory has dropped dramatically
Memory Management, Early Systems
Memory Management, Early Systems Single-User Contiguous Scheme Fixed Partitions Dynamic Partitions Deallocation Relocatable Dynamic Partitions Conclusion Single User Configurations Fixed Partitions Dynamic
Operating Systems Lecture #2b: Early Paradigms of Memory Management II
Lecture #2b: Early Paradigms of Memory Management II Written by based on the lecture series of Dr. Dayou Li and the book Understanding 4th ed. by I.M.Flynn and A.McIver McHoes (2006) Department of Computer
Memory Management. Memory Management
Memory Management Logical vs. physical address space Fragmentation Paging Segmentation Reading: Silberschatz, Ch. 8 Memory Management Observations: Process needs at least CPU and memory to run. CPU context
COSC243 Part 2: Operating Systems
COSC243 Part 2: Operating Systems Lecture 25: Revision Zhiyi Huang Dept. of Computer Science, University of Otago Zhiyi Huang (Otago) COSC243 Lecture 25 1 / 11 Overview What s going to be in the exam?
Operating Systems. Memory Management. Memory management
Oerating Systems Memory management Memory Management List of Toics 1. Memory Management 2. Memory In Systems Design 3. Binding Times 4. Introduction to Memory Management 5. Raw Memory Model 6. Single Contiguous