stack Two-dimensional logical addresses Fixed Allocation Binary Page Table
|
|
|
- Valentine Young
- 6 years ago
- Views:
Transcription
1 Question # 1 of 10 ( Start time: 07:24:13 AM ) Total Marks: 1 LRU page replacement algorithm can be implemented by counter stack linked list all of the given options Question # 2 of 10 ( Start time: 07:25:28 AM ) Total Marks: 1 The segment table maps the to physical addresses. Page addresses Shared page addresses One-dimensional logical addresses Two-dimensional logical addresses Question # 3 of 10 ( Start time: 07:26:28 AM ) Total Marks: 1 Assume a logical address space of 16 pages, each of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for f (frames)? Question # 4 of 10 ( Start time: 07:27:55 AM ) Total Marks: 1 In scheme free frames are equally divided among processes. Fixed Allocation Proportional Allocation Priority Allocation None of the given options Question # 5 of 10 (Start time: 07:28:37 AM) Total Marks: 1 Following schemes allow efficient implementations of page tables EXCEPT Hashed Page Table Hierarchical / Multilevel Inverted Page Table Binary Page Table
2 Question # 6 of 10 ( Start time: 07:29:25 AM ) Total Marks: 1 FIFO Page Replacement Algorithm has the lowest page fault rate True False Question # 7 of 10 ( Start time: 07:30:04 AM ) Total Marks: 1 The major criterion in the selection of a particular algorithm is that we want to minimize the number of page faults. increase efficiency. reduce running time of page replacement algorithm. maximize the number of page faults. Question # 8 of 10 ( Start time: 07:30:50 AM ) Total Marks: 1 In allocation scheme number of frames allocated to a process is proportional to its size. Fixed Allocation Proportional Allocation Priority Allocation None of the given options Question # 9 of 10 ( Start time: 07:31:21 AM ) Total Marks: 1 It is not possible to run a program whose size is greater than the size of the main memory. True False Question # 10 of 10 ( Start time: 07:31:37 AM ) Total Marks: 1 The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a address, and the address it gets translated to by the MMU is called a address. Virtual, physical Hexadecimal, Binary Valid, invalid Physical, Virtual Question # 1 of 10 ( Start time: 10:02:11 PM ) Total Marks: 1 Memory protection in paging is achieved by associating with each page. This bit indicates whether the page is in the process address space or not. protection bits counting bits paging table segment table
3 Question # 2 of 10 ( Start time: 10:02:53 PM ) Total Marks: 1 The main objective of LRU Page Replacement Algorithm is to replace that page which is referenced most frequently replace the page which is replaced most recently replace the page which is used urgently replace that page which was used most previously Question # 3 of 10 ( Start time: 10:03:42 PM ) Total Marks: 1 The high paging activity is called Page Fault Multiprogramming Thrashing Question # 4 of 10 ( Start time: 10:04:26 PM ) Total Marks: 1 For some page replacement algorithms, the page fault rate may increase as the number of allocated frames. constant decreased increased All of the given Question # 5 of 10 ( Start time: 10:05:08 PM ) Total Marks: 1 is the separation of user logical memory from physical memory. ROM Physical memory Virtual Memory None of the given options Question # 6 of 10 ( Start time: 10:05:58 PM ) Total Marks: keep in memory only those instructions and data that are needed at any given time. Fragmentation Swapping Overlays
4 Question # 7 of 10 ( Start time: 10:06:23 PM ) Total Marks: 1 An optimal page-replacement algorithm has the lowest page fault rate of all algorithms. True False Question # 8 of 10 ( Start time: 10:06:48 PM ) Total Marks: 1 is a memory management scheme that supports? Programmer s view of memory System s view of memory Hardware s view of memory None of the given Question # 9 of 10 ( Start time: 10:07:17 PM ) Total Marks: 1 Address Binding will be in Multiprogramming with Variable Tasks (MVT) Dynamic Static Variable Fixed Question # 10 of 10 ( Start time: 10:07:42 PM ) Total Marks: 1 A system is similar to a paging system with swapping Context switching Demand paging Page fault None of the given options Question # 1 of 10 ( Start time: 11:12:21 PM ) Total Marks: 1 When the process tries to access locations that are not in memory, the hardware traps the operating system. This is called as. Page Fault Page replacement Question # 2 of 10 ( Start time: 11:13:16 PM ) Total Marks: 1 The main objective of LRU Page Replacement Algorithm is to replace that page which is referenced most frequently replace the page which is replaced most recently replace the page which is used urgently
5 replace that page which was used most previously Question # 3 of 10 ( Start time: 11:13:36 PM ) Total Marks: 1 In memory management programmer s view of memory representation is called. Logical address Physical address Offset Question # 4 of 10 ( Start time: 11:14:37 PM ) Total Marks: 1 The size of pages and frames are same in logical memory and physical memory respectively. True False Question # 5 of 10 ( Start time: 11:15:35 PM ) Total Marks: 1 Optimal Page Replacement Algorithm provides a benchmark in assessing other page replacement algorithms. True False Question # 6 of 10 ( Start time: 11:16:06 PM ) Total Marks: holds the smallest legal physical memory address for a process Base register Limit register Index register Stack pointers register Question # 7 of 10 ( Start time: 11:16:44 PM ) Total Marks: 1 is the separation of user logical memory from physical memory. ROM Physical memory Virtual Memory None of the given options Question # 8 of 10 ( Start time: 11:17:09 PM ) Total Marks: 1 We want a page replacement algorithm with the page fault rate. Highest Lowest
6 Normal None of the given Question # 9 of 10 ( Start time: 11:17:31 PM ) Total Marks: 1 In Swapping technique of Memory Management, the total amount transfer time is directly proportional to the. amount of memory swapped amount of space on backing store space on main memory all the given options are correct Question # 10 of 10 ( Start time: 11:18:55 PM ) Total Marks: 1 To eliminate external fragmentation in segmentation the scheme used is. Fixed size partition scheme Variable size partition scheme Fixed size paging scheme Variable size paging scheme Question # 10 of 10 ( Start time: 08:16:49 PM ) Total Marks: 1 The size of pages and frames are same in logical memory and physical memory respectively. True False Question # 9 of 10 ( Start time: 08:15:59 PM ) Total Marks: 1 In Overlay technique, we can overload any part of the program with the part of the program required needed recently. True False Question # 8 of 10 ( Start time: 08:15:19 PM ) Total Marks: refers to the situation when free memory space exists to load a process in the memory but the space is not contiguous. Internal fragmentation Swapping
7 External Fragmentation Question # 7 of 10 ( Start time: 08:14:27 PM ) Total Marks: 1 When the process tries to access locations that are not in memory, the hardware traps the operating system. This is called as. Page Fault Page replacement Question # 6 of 10 ( Start time: 08:13:44 PM ) Total Marks: 1 LRU page replacement algorithm can be implemented by counter stack linked list all of the given options Question # 5 of 10 ( Start time: 08:12:42 PM ) Total Marks: 1 Each page is a power of bytes long in paging scheme Question # 4 of 10 ( Start time: 08:11:55 PM ) Total Marks: holds the smallest legal physical memory address for a process Base register Limit register Index register Stack pointers register Question # 3 of 10 ( Start time: 08:10:37 PM ) Total Marks: 1 In memory management programmer s view of memory representation is called.
8 Logical address Physical address Offset Question # 2 of 10 ( Start time: 08:10:00 PM ) Total Marks: 1 The main criteria for Page Replacement in Optimal Page Replacement Algorithm is to replace that page which will not be used for the longest period of time. replace that page which will be required most frequently in the execution of a process replace the page which is biggest in size replace the page which is smaller in size Question # 1 of 10 ( Start time: 08:09:29 PM ) Total Marks: 1 is caused due to un-used space in fixed size blocks/ pages. Internal fragmentation External fragmentation MVT Question # 10 of 10 ( Start time: 07:50:19 PM ) Total Marks: 1 In a UNIX system, system call can be used to request the operating system to memory map an opened file. mmap( ) fork ( ) exec( ) read( ) Question # 9 of 10 ( Start time: 07:49:42 PM ) Total Marks: 1 The logical address of Intel is. 36 bits 48 bits
9 64 bits 128 bits Question # 8 of 10 ( Start time: 07:49:25 PM ) Total Marks: 1 Memory protection in paging is achieved by associating with each page. This bit indicates whether the page is in the process address space or not. protection bits counting bits paging table segment table Question # 7 of 10 ( Start time: 07:49:04 PM ) Total Marks: 1 External Fragmentation takes place in Multiprogramming with Variable Tasks (MVT) Multiprogramming with Fixed Tasks (MFT) Multi-tasking Question # 6 of 10 ( Start time: 07:48:14 PM ) Total Marks: 1 For some page replacement algorithms, the page fault rate may increase as the number of allocated frames. constant decreased increased All of the given Question # 5 of 10 ( Start time: 07:47:53 PM ) Total Marks: 1 A process is if it is spending more time on paging Thrashing Demand paging Fixed Allocation Question # 4 of 10 ( Start time: 07:47:34 PM ) Total Marks: 1
10 In paged segmentation, we divide every segment in a process into pages. Fixed size Variable size Question # 3 of 10 ( Start time: 07:47:01 PM ) Total Marks: register contains the size of the process Base register Index register Limit register Stack pointers register Question # 10 of 10 ( Start time: 07:46:06 PM ) Total Marks: 1 is caused due to un-used space in physical memory. Internal fragmentation External fragmentation MVT Question # 9 of 10 ( Start time: 07:45:09 PM ) Total Marks: 1 The main objective of LRU Page Replacement Algorithm is to replace that page which is referenced most frequently replace the page which is replaced most recently replace the page which is used urgently replace that page which was used most previously Question # 8 of 10 ( Start time: 07:44:36 PM ) Total Marks: 1 In paged segmentation, we divide every segment in a process into pages. Fixed size Variable size Question # 7 of 10 ( Start time: 07:43:42 PM ) Total Marks: 1
11 Following are the advantages of Virtual memory EXCEPT Efficient process creation Concept of memory mapped files Low CPU consumption Running large sized processes Question # 6 of 10 ( Start time: 07:42:39 PM ) Total Marks: 1 Intel is basically designed for following Operating Systems except. MULTICS OS/2 Windows Linux Question # 5 of 10 ( Start time: 07:41:57 PM ) Total Marks: holds the smallest legal physical memory address for a process Base register Limit register Index register Stack pointers register Question # 4 of 10 ( Start time: 07:41:20 PM ) Total Marks: 1 The main criteria for Page Replacement in Optimal Page Replacement Algorithm is to replace that page which will not be used for the longest period of time. replace that page which will be required most frequently in the execution of a process replace the page which is biggest in size replace the page which is smaller in size Question # 3 of 10 ( Start time: 07:40:31 PM ) Total Marks: 1 The segment table maps the to physical addresses. Page addresses Shared page addresses One-dimensional logical addresses
12 Two-dimensional logical addresses Question # 2 of 10 ( Start time: 07:39:48 PM ) Total Marks: 1 In case of thrashing if CPU utilization is too low the operating system the degree of multiprogramming. increases decreases sometimes increases and sometimes decreases None of the given options Question # 10 of 10 ( Start time: 09:59:57 PM ) Total Marks: 1 Assume a logical address space of 16 pages of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for p (page number)? 4 bits 8 bits 16 bits 32 bits Question # 9 of 10 ( Start time: 09:59:28 PM ) Total Marks: 1 When the process tries to access locations that are not in memory, the hardware traps the operating system. This is called as. Page Fault Page replacement Question # 8 of 10 ( Start time: 09:58:37 PM ) Total Marks: 1 Following schemes allow efficient implementations of page tables EXCEPT Hashed Page Table Hierarchical / Multilevel Inverted Page Table Binary Page Table
13 Question # 7 of 10 ( Start time: 09:58:02 PM ) Total Marks: 1 Assume a logical address space of 16 pages, each of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for f (frames)? Question # 6 of 10 ( Start time: 09:57:29 PM ) Total Marks: holds the smallest legal physical memory address for a process Base register Limit register Index register Stack pointers register Question # 5 of 10 ( Start time: 09:57:02 PM ) Total Marks: 1 The high paging activity is called Page Fault Multiprogramming Thrashing Question # 4 of 10 ( Start time: 09:56:11 PM ) Total Marks: 1 The term pager is used in connection with. Demand Paged
14 Question # 3 of 10 ( Start time: 09:55:33 PM ) Total Marks: 1 A page table needed for keeping track of pages of the page table is called level paging Page directory Page size Page table size Question # 2 of 10 ( Start time: 09:54:25 PM ) Total Marks: 1 A program cannot execute unless whole or necessary part of it resides in the main memory. True False Question # 1 of 10 ( Start time: 09:53:36 PM ) Total Marks: 1 The address generated by the CPU, after any indexing or other addressing-mode arithmetic, is called a address, and the address it gets translated to by the MMU is called a address. Virtual, physical Hexadecimal, Binary Valid, invalid Physical, Virtual Question # 10 of 10 ( Start time: 09:49:55 PM ) Total Marks: 1 In case of thrashing if CPU utilization is too low the operating system the degree of multiprogramming. increases decreases sometimes increases and sometimes decreases None of the given options Question # 9 of 10 ( Start time: 09:49:20 PM ) Total Marks: 1
15 Following statement is NOT true about Virtual memory. Virtual memory help in executing bigger programs even greater in size that of main memory. Virtual memory makes the processes to stuck when the collective size of all the processes becomes greater than the size of main memory. Virtual memory also allows files and memory to be shared by several different processes through page sharing. Virtual memory makes the task of programming easier because the programmer need not worry about the amount of physical memory, Question # 8 of 10 ( Start time: 09:48:56 PM ) Total Marks: 1 Address Binding will be in Multiprogramming with Variable Tasks (MVT) Dynamic Static Variable Fixed Question # 7 of 10 ( Start time: 09:48:20 PM ) Total Marks: 1 In allocation scheme number of frames allocated to a process is proportional to its size. Fixed Allocation Proportional Allocation Priority Allocation None of the given options Question # 6 of 10 ( Start time: 09:47:37 PM ) Total Marks: 1 A system is similar to a paging system with swapping Context switching Demand paging Page fault None of the given options
16 Question # 5 of 10 ( Start time: 09:47:11 PM ) Total Marks: 1 Physical memory is broken down into fixed-sized blocks, called and Logical memory is divided into blocks of the same size, called Frames, pages Pages, Frames Frames, holes Holes, segments Question # 4 of 10 ( Start time: 09:46:40 PM ) Total Marks: 1 A program can not execute unless whole or necessary part of it resides in the main memory. True False Question # 3 of 10 ( Start time: 09:46:09 PM ) Total Marks: 1 Each page is a power of bytes long in paging scheme Question # 2 of 10 ( Start time: 09:45:47 PM ) Total Marks: 1 In paged segmentation, we divide every segment in a process into pages. Fixed size Variable size Question # 1 of 10 ( Start time: 09:45:16 PM ) Total Marks: 1 Memory protection in paging is achieved by associating with each page. This bit indicates whether the page is in the process address space or not. protection bits
17 counting bits paging table segment table Question # 10 of 10 ( Start time: 09:40:22 PM ) Total Marks: 1 The size of a page is defined by. CPU Page Table Physical Memory Logical Memory Question # 9 of 10 ( Start time: 09:40:04 PM ) Total Marks: 1 In paged segmentation, we divide every segment in a process into pages. Fixed size Variable size Question # 8 of 10 ( Start time: 09:39:46 PM ) Total Marks: 1 When the process tries to access locations that are not in memory, the hardware traps the operating system. This is called as. Page Fault Page replacement Question # 7 of 10 ( Start time: 09:39:28 PM ) Total Marks: 1 We want a page replacement algorithm with the page-fault rate. Highest Lowest Normal None of the given Question # 6 of 10 ( Start time: 09:38:46 PM ) Total Marks: 1
18 The term pager is used in connection with. Demand Paged Question # 5 of 10 ( Start time: 09:38:20 PM ) Total Marks: keep in memory only those instructions and data that are needed at any given time. Fragmentation Swapping Overlays Question # 4 of 10 ( Start time: 09:37:44 PM ) Total Marks: 1 Following statement is NOT true about Virtual memory. Virtual memory help in executing bigger programs even greater in size that of main memory. Virtual memory makes the processes to stuck when the collective size of all the processes becomes greater than the size of main memory. Virtual memory also allows files and memory to be shared by several different processes through page sharing. Virtual memory makes the task of programming easier because the programmer need not worry about the amount of physical memory, Question # 3 of 10 ( Start time: 09:37:04 PM ) Total Marks: 1 Assume a logical address space of 16 pages of 1024 words, each mapped into a physical memory of 32 frames. Each word consists of 2 bytes. What will be the total number of bits required for p (page number)? 4 bits 8 bits 16 bits 32 bits
19 Question # 2 of 10 ( Start time: 09:36:35 PM ) Total Marks: 1 Physical memory is broken down into fixed-sized blocks, called and Logical memory is divided into blocks of the same size, called Frames, pages Pages, Frames Frames, holes Holes, segments Question # 1 of 10 ( Start time: 09:36:11 PM ) Total Marks: 1 A process is if it is spending more time on paging Thrashing Demand paging Fixed Allocation
Chapters 9 & 10: Memory Management and Virtual Memory
Chapters 9 & 10: Memory Management and Virtual Memory Important concepts (for final, projects, papers) addressing: physical/absolute, logical/relative/virtual overlays swapping and paging memory protection
CS 143A - Principles of Operating Systems
CS 143A - Principles of Operating Systems Operating Systems - Review of content from midterm to final Prof. Nalini Venkatasubramanian nalini@ics.uci.edu Deadlocks System Model Resource allocation graph,
Virtual Memory Outline
Virtual Memory Outline Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating Kernel Memory Other Considerations Operating-System Examples
Chapter 9: Virtual Memory. Operating System Concepts 9 th Edition
Chapter 9: Virtual Memory Silberschatz, Galvin and Gagne 2013 Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating
Addresses in the source program are generally symbolic. A compiler will typically bind these symbolic addresses to re-locatable addresses.
1 Memory Management Address Binding The normal procedures is to select one of the processes in the input queue and to load that process into memory. As the process executed, it accesses instructions and
Memory Management Cache Base and Limit Registers base limit Binding of Instructions and Data to Memory Compile time absolute code Load time
Memory Management To provide a detailed description of various ways of organizing memory hardware To discuss various memory-management techniques, including paging and segmentation To provide a detailed
Background. Virtual Memory (2/2) Demand Paging Example. First-In-First-Out (FIFO) Algorithm. Page Replacement Algorithms. Performance of Demand Paging
Virtual Memory (/) Background Page Replacement Allocation of Frames Thrashing Background Virtual memory separation of user logical memory from physical memory. Only part of the program needs to be in memory
Chapter 9: Memory Management. Background
1 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
Memory Management. To improve CPU utilization in a multiprogramming environment we need multiple programs in main memory at the same time.
Memory Management To improve CPU utilization in a multiprogramming environment we need multiple programs in main memory at the same time. Basic CPUs and Physical Memory CPU cache Physical memory
Memory Management. 3. What two registers can be used to provide a simple form of memory protection? Base register Limit Register
Memory Management 1. Describe the sequence of instruction-execution life cycle? A typical instruction-execution life cycle: Fetches (load) an instruction from specific memory address. Decode the instruction
Virtual Memory COMPSCI 386
Virtual Memory COMPSCI 386 Motivation An instruction to be executed must be in physical memory, but there may not be enough space for all ready processes. Typically the entire program is not needed. Exception
Chapter 8 & Chapter 9 Main Memory & Virtual Memory
Chapter 8 & Chapter 9 Main Memory & Virtual Memory 1. Various ways of organizing memory hardware. 2. Memory-management techniques: 1. Paging 2. Segmentation. Introduction Memory consists of a large array
Operating Systems. 09. Memory Management Part 1. Paul Krzyzanowski. Rutgers University. Spring 2015
Operating Systems 09. Memory Management Part 1 Paul Krzyzanowski Rutgers University Spring 2015 March 9, 2015 2014-2015 Paul Krzyzanowski 1 CPU Access to Memory The CPU reads instructions and reads/write
Chapter 8: Virtual Memory. Operating System Concepts Essentials 2 nd Edition
Chapter 8: Virtual Memory Silberschatz, Galvin and Gagne 2013 Chapter 8: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating
Module 9: Virtual Memory
Module 9: Virtual Memory Background Demand Paging Performance of Demand Paging Page Replacement Page-Replacement Algorithms Allocation of Frames Thrashing Other Considerations Demand Segmenation 9.1 Background
Part-A QUESTION BANK UNIT-III 1. Define Dynamic Loading. To obtain better memory-space utilization dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. All routines
Basic Memory Management. Basic Memory Management. Address Binding. Running a user program. Operating Systems 10/14/2018 CSC 256/456 1
Basic Memory Management Program must be brought into memory and placed within a process for it to be run Basic Memory Management CS 256/456 Dept. of Computer Science, University of Rochester Mono-programming
Module 8: Memory Management
Module 8: Memory Management Background Logical versus Physical Address Space Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging Operating System Concepts 8.1 Silberschatz and Galvin
ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective. Part I: Operating system overview: Memory Management
ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective Part I: Operating system overview: Memory Management 1 Hardware background The role of primary memory Program
Chapter 9: Virtual Memory
Chapter 9: Virtual Memory Silberschatz, Galvin and Gagne 2013 Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating
Module 9: Virtual Memory
Module 9: Virtual Memory Background Demand Paging Performance of Demand Paging Page Replacement Page-Replacement Algorithms Allocation of Frames Thrashing Other Considerations Demand Segmentation Operating
Chapter 9: Virtual Memory
Chapter 9: Virtual Memory Multiprogramming Memory Management so far 1. Dynamic Loading The main Program gets loaded into memory Routines are stored in Relocatable Load format on disk As main program (or
1. Background. 2. Demand Paging
COSC4740-01 Operating Systems Design, Fall 2001, Byunggu Yu Chapter 10 Virtual Memory 1. Background PROBLEM: The entire process must be loaded into the memory to execute limits the size of a process (it
MEMORY 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
Logical versus Physical Address Space
CHAPTER 8: MEMORY MANAGEMENT Background Logical versus Physical Address Space Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging Operating System Concepts, Addison-Wesley 1994
EXAMS CS604- OPERATING SYSTEMS
MUHAMMAD FAISAL MIT 4 th Semester Al-Barq Campus (VGJW01) Gujranwala faisalgrw123@gmail.com Solved Reference MCQ s For Final TERM EXAMS CS604- OPERATING SYSTEMS Question No: 1 ( Marks: 1 ) - Please choose
Virtual Memory. CSCI 315 Operating Systems Design Department of Computer Science
Virtual Memory CSCI 315 Operating Systems Design Department of Computer Science Notice: The slides for this lecture have been largely based on those from an earlier edition of the course text Operating
Chapter 8: Virtual Memory. Operating System Concepts
Chapter 8: Virtual Memory Silberschatz, Galvin and Gagne 2009 Chapter 8: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating
Operating Systems. Designed and Presented by Dr. Ayman Elshenawy Elsefy
Operating Systems Designed and Presented by Dr. Ayman Elshenawy Elsefy Dept. of Systems & Computer Eng.. AL-AZHAR University Website : eaymanelshenawy.wordpress.com Email : eaymanelshenawy@yahoo.com Reference
Chapter 9: Virtual-Memory
Chapter 9: Virtual-Memory Management Chapter 9: Virtual-Memory Management Background Demand Paging Page Replacement Allocation of Frames Thrashing Other Considerations Silberschatz, Galvin and Gagne 2013
Basic Memory Management
Basic Memory Management CS 256/456 Dept. of Computer Science, University of Rochester 10/15/14 CSC 2/456 1 Basic Memory Management Program must be brought into memory and placed within a process for it
Part Three - Memory Management. Chapter 8: Memory-Management Strategies
Part Three - Memory Management Chapter 8: Memory-Management Strategies Chapter 8: Memory-Management Strategies 8.1 Background 8.2 Swapping 8.3 Contiguous Memory Allocation 8.4 Segmentation 8.5 Paging 8.6
Module 8: Memory Management
Module 8: Memory Management Background Logical versus Physical Address Space Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 8.1 Background Program must be brought into memory
Page Replacement. 3/9/07 CSE 30341: Operating Systems Principles
Page Replacement page 1 Page Replacement Algorithms Want lowest page-fault rate Evaluate algorithm by running it on a particular string of memory references (reference string) and computing the number
Module 9: Memory Management. Background. Binding of Instructions and Data to Memory
Module 9: Memory Management Background Logical versus Physical Address Space Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 9.1 Background Program must be brought into memory
CS420: Operating Systems
Virtual Memory James Moscola Department of Physical Sciences York College of Pennsylvania Based on Operating System Concepts, 9th Edition by Silberschatz, Galvin, Gagne Background Code needs to be in memory
Chapter 9: Virtual Memory
Chapter 9: Virtual Memory Chapter 9: Virtual Memory 9.1 Background 9.2 Demand Paging 9.3 Copy-on-Write 9.4 Page Replacement 9.5 Allocation of Frames 9.6 Thrashing 9.7 Memory-Mapped Files 9.8 Allocating
CS6401- Operating System UNIT-III STORAGE MANAGEMENT
UNIT-III STORAGE MANAGEMENT Memory Management: Background In general, to rum a program, it must be brought into memory. Input queue collection of processes on the disk that are waiting to be brought into
Operating Systems. Overview Virtual memory part 2. Page replacement algorithms. Lecture 7 Memory management 3: Virtual memory
Operating Systems Lecture 7 Memory management : Virtual memory Overview Virtual memory part Page replacement algorithms Frame allocation Thrashing Other considerations Memory over-allocation Efficient
Chapter 9: Virtual-Memory Management. Operating System Concepts 8 th Edition,
Chapter 9: Virtual-Memory Management, Silberschatz, Galvin and Gagne 2009 Chapter 9: Virtual-Memory Management Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped
Lecture 17. Edited from slides for Operating System Concepts by Silberschatz, Galvin, Gagne
Lecture 17 Edited from slides for Operating System Concepts by Silberschatz, Galvin, Gagne Page Replacement Algorithms Last Lecture: FIFO Optimal Page Replacement LRU LRU Approximation Additional-Reference-Bits
Chapter 8: Main Memory
Chapter 8: Main Memory Operating System Concepts 8 th Edition,! Silberschatz, Galvin and Gagne 2009! Chapter 8: Memory Management Background" Swapping " Contiguous Memory Allocation" Paging" Structure
Virtual or Logical. Logical Addr. MMU (Memory Mgt. Unit) Physical. Addr. 1. (50 ns access)
Virtual Memory - programmer views memory as large address space without concerns about the amount of physical memory or memory management. (What do the terms 3-bit (or 6-bit) operating system or overlays
I.-C. Lin, Assistant Professor. Textbook: Operating System Concepts 8ed CHAPTER 8: MEMORY
I.-C. Lin, Assistant Professor. Textbook: Operating System Concepts 8ed CHAPTER 8: MEMORY MANAGEMENT Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of the
B. V. Patel Institute of Business Management, Computer &Information Technology, UTU
BCA-3 rd Semester 030010304-Fundamentals Of Operating Systems Unit: 1 Introduction Short Answer Questions : 1. State two ways of process communication. 2. State any two uses of operating system according
Chapter 8 Virtual Memory
Operating Systems: Internals and Design Principles Chapter 8 Virtual Memory Seventh Edition William Stallings Operating Systems: Internals and Design Principles You re gonna need a bigger boat. Steven
Chapter 8 Main Memory
Chapter 8 Main Memory 8.1, 8.2, 8.3, 8.4, 8.5 Chapter 9 Virtual memory 9.1, 9.2, 9.3 https://www.akkadia.org/drepper/cpumemory.pdf Images from Silberschatz Pacific University 1 How does the OS manage memory?
Chapter 8: Main Memory
Chapter 8: Main Memory Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation Example: The Intel Pentium 8.2 Silberschatz, Galvin
8.1 Background. Part Four - Memory Management. Chapter 8: Memory-Management Management Strategies. Chapter 8: Memory Management
Part Four - Memory Management 8.1 Background Chapter 8: Memory-Management Management Strategies Program must be brought into memory and placed within a process for it to be run Input queue collection of
Chapter 4 Memory Management
Chapter 4 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 4.6 Design issues for paging systems 4.7
Memory management: outline
Memory management: outline Concepts Swapping Paging o Multi-level paging o TLB & inverted page tables 1 Memory size/requirements are growing 1951: the UNIVAC computer: 1000 72-bit words! 1971: the Cray
Memory management: outline
Memory management: outline Concepts Swapping Paging o Multi-level paging o TLB & inverted page tables 1 Memory size/requirements are growing 1951: the UNIVAC computer: 1000 72-bit words! 1971: the Cray
Background. Demand Paging. valid-invalid bit. Tevfik Koşar. CSC Operating Systems Spring 2007
CSC 0 - Operating Systems Spring 007 Lecture - XIII Virtual Memory Tevfik Koşar Background Virtual memory separation of user logical memory from physical memory. Only part of the program needs to be in
Operating Systems. IV. Memory Management
Operating Systems IV. Memory Management Ludovic Apvrille ludovic.apvrille@telecom-paristech.fr Eurecom, office 470 http://soc.eurecom.fr/os/ @OS Eurecom Outline Basics of Memory Management Hardware Architecture
Outline. V Computer Systems Organization II (Honors) (Introductory Operating Systems) Advantages of Multi-level Page Tables
Outline V22.0202-001 Computer Systems Organization II (Honors) (Introductory Operating Systems) Lecture 15 Memory Management (cont d) Virtual Memory March 30, 2005 Announcements Lab 4 due next Monday (April
Chapter 8: Memory Management Strategies
Chapter 8: Memory- Management Strategies, Silberschatz, Galvin and Gagne 2009 Chapter 8: Memory Management Strategies Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table
Chapter 8: Memory Management. Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging
Chapter 8: Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 1 Background Memory management is crucial in better utilizing one of the most important
CS450/550 Operating Systems
CS450/550 Operating Systems Lecture 4 memory Palden Lama Department of Computer Science CS450/550 Memory.1 Review: Summary of Chapter 3 Deadlocks and its modeling Deadlock detection Deadlock recovery Deadlock
Modeling Page Replacement: Stack Algorithms. Design Issues for Paging Systems
Modeling Page Replacement: Stack Algorithms 7 4 6 5 State of memory array, M, after each item in reference string is processed CS450/550 Memory.45 Design Issues for Paging Systems Local page replacement
Virtual Memory. Virtual Memory. Demand Paging. valid-invalid bit. Virtual Memory Larger than Physical Memory
Virtual Memory Virtual Memory CSCI Operating Systems Design Department of Computer Science Virtual memory separation of user logical memory from physical memory. Only part of the program needs to be in
Memory Management and Protection
Part IV Memory Management and Protection Sadeghi, Cubaleska RUB 2008-09 Course Operating System Security Memory Management and Protection Main Memory Virtual Memory Roadmap of Chapter 4 Main Memory Background
OPERATING SYSTEM. Chapter 9: Virtual Memory
OPERATING SYSTEM Chapter 9: Virtual Memory Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating Kernel Memory
CS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 L20 Virtual Memory Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Questions from last time Page
Objectives and Functions Convenience. William Stallings Computer Organization and Architecture 7 th Edition. Efficiency
William Stallings Computer Organization and Architecture 7 th Edition Chapter 8 Operating System Support Objectives and Functions Convenience Making the computer easier to use Efficiency Allowing better
I.-C. Lin, Assistant Professor. Textbook: Operating System Principles 7ed CHAPTER 8: MEMORY
I.-C. Lin, Assistant Professor. Textbook: Operating System Principles 7ed CHAPTER 8: MEMORY MANAGEMENT Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of
Memory Management. Chapter 4 Memory Management. Multiprogramming with Fixed Partitions. Ideally programmers want memory that is.
Chapter 4 Memory Management Ideally programmers want memory that is Memory Management large fast non volatile 4.1 Basic memory management 4.2 Swapping 4.3 Virtual memory 4.4 Page replacement algorithms
Operating System Concepts
Chapter 9: Virtual-Memory Management 9.1 Silberschatz, Galvin and Gagne 2005 Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped
Operating System Support
Operating System Support Objectives and Functions Convenience Making the computer easier to use Efficiency Allowing better use of computer resources Layers and Views of a Computer System Operating System
Chapter 7: Main Memory. Operating System Concepts Essentials 8 th Edition
Chapter 7: Main Memory Operating System Concepts Essentials 8 th Edition Silberschatz, Galvin and Gagne 2011 Chapter 7: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure
Chapter 8 Memory Management
Chapter 8 Memory Management Da-Wei Chang CSIE.NCKU Source: Abraham Silberschatz, Peter B. Galvin, and Greg Gagne, "Operating System Concepts", 9th Edition, Wiley. 1 Outline Background Swapping Contiguous
Chapter 8: Memory Management. Operating System Concepts with Java 8 th Edition
Chapter 8: Memory Management 8.1 Silberschatz, Galvin and Gagne 2009 Background Program must be brought (from disk) into memory and placed within a process for it to be run Main memory and registers are
CSE 4/521 Introduction to Operating Systems. Lecture 27 (Final Exam Review) Summer 2018
CSE 4/521 Introduction to Operating Systems Lecture 27 (Final Exam Review) Summer 2018 Overview Objective: Revise topics and questions for the final-exam. 1. Main Memory 2. Virtual Memory 3. Mass Storage
Chapter 10: Virtual Memory. Background
Chapter 10: Virtual Memory Background Demand Paging Process Creation Page Replacement Allocation of Frames Thrashing Operating System Examples 10.1 Background Virtual memory separation of user logical
Virtual Memory. CSCI 315 Operating Systems Design Department of Computer Science
Virtual Memory CSCI 315 Operating Systems Design Department of Computer Science Notice: The slides for this lecture were based on those Operating Systems Concepts, 9th ed., by Silberschatz, Galvin, and
Memory Management. Memory Management
Memory Management Gordon College Stephen Brinton Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 1 Background Program must be brought into memory
Chapter 8 Virtual Memory
Chapter 8 Virtual Memory Contents Hardware and control structures Operating system software Unix and Solaris memory management Linux memory management Windows 2000 memory management Characteristics of
Chapter 8: Memory Management
Chapter 8: Memory Management Chapter 8: Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 8.2 Background Program must be brought into memory and placed
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
Chapter 10: Virtual Memory. Background. Demand Paging. Valid-Invalid Bit. Virtual Memory That is Larger Than Physical Memory
Chapter 0: Virtual Memory Background Background Demand Paging Process Creation Page Replacement Allocation of Frames Thrashing Operating System Examples Virtual memory separation of user logical memory
File Systems. OS Overview I/O. Swap. Management. Operations CPU. Hard Drive. Management. Memory. Hard Drive. CSI3131 Topics. Structure.
File Systems I/O Management Hard Drive Management Virtual Memory Swap Memory Management Storage and I/O Introduction CSI3131 Topics Process Management Computing Systems Memory CPU Peripherals Processes
Memory management. Requirements. Relocation: program loading. Terms. Relocation. Protection. Sharing. Logical organization. Physical organization
Requirements Relocation Memory management ability to change process image position Protection ability to avoid unwanted memory accesses Sharing ability to share memory portions among processes Logical
Chapter 8: Main Memory. Operating System Concepts 8th Edition
Chapter 8: Main Memory Operating System Concepts 8th Edition Silberschatz, Galvin and Gagne 2009 Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of the Page
Virtual Memory. Chapter 8
Virtual Memory 1 Chapter 8 Characteristics of Paging and Segmentation Memory references are dynamically translated into physical addresses at run time E.g., process may be swapped in and out of main memory
Chapter 4 Memory Management. Memory Management
Chapter 4 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 4.6 Design issues for paging systems 4.7
Chapter 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:
Memory 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
Chapter 8: Memory- Manage g me m nt n S tra r t a e t gie i s
Chapter 8: Memory- Management Strategies Chapter 8: Memory Management Background Swapping Contiguous Memory Allocation Paging Structure of the Page Table Segmentation Example: The Intel Pentium 2009/12/16
6 - Main Memory EECE 315 (101) ECE UBC 2013 W2
6 - Main Memory EECE 315 (101) ECE UBC 2013 W2 Acknowledgement: This set of slides is partly based on the PPTs provided by the Wiley s companion website (including textbook images, when not explicitly
MEMORY MANAGEMENT. Jo, Heeseung
MEMORY MANAGEMENT Jo, Heeseung TODAY'S TOPICS Why is memory management difficult? Old memory management techniques: Fixed partitions Variable partitions Swapping Introduction to virtual memory 2 MEMORY
Chapter 9: Virtual Memory
Chapter 9: Virtual Memory Background Demand Paging Chapter 9: Virtual Memory Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating Kernel Memory Other Considerations
Memory Management. Jo, Heeseung
Memory Management Jo, Heeseung Today's Topics Why is memory management difficult? Old memory management techniques: Fixed partitions Variable partitions Swapping Introduction to virtual memory 2 Memory
ADRIAN PERRIG & TORSTEN HOEFLER Networks and Operating Systems ( ) Chapter 6: Demand Paging
ADRIAN PERRIG & TORSTEN HOEFLER Networks and Operating Systems (5-006-00) Chapter 6: Demand Paging http://redmine.replicant.us/projects/replicant/wiki/samsunggalaxybackdoor (0) # Inverted page table One
CS307: Operating Systems
CS307: Operating Systems Chentao Wu 吴晨涛 Associate Professor Dept. of Computer Science and Engineering Shanghai Jiao Tong University SEIEE Building 3-513 wuct@cs.sjtu.edu.cn Download Lectures ftp://public.sjtu.edu.cn
Final Exam Preparation Questions
EECS 678 Spring 2013 Final Exam Preparation Questions 1 Chapter 6 1. What is a critical section? What are the three conditions to be ensured by any solution to the critical section problem? 2. The following
CISC 7310X. C08: Virtual Memory. Hui Chen Department of Computer & Information Science CUNY Brooklyn College. 3/22/2018 CUNY Brooklyn College
CISC 7310X C08: Virtual Memory Hui Chen Department of Computer & Information Science CUNY Brooklyn College 3/22/2018 CUNY Brooklyn College 1 Outline Concepts of virtual address space, paging, virtual page,
ECE519 Advanced Operating Systems
IT 540 Operating Systems ECE519 Advanced Operating Systems Prof. Dr. Hasan Hüseyin BALIK (8 th Week) (Advanced) Operating Systems 8. Virtual Memory 8. Outline Hardware and Control Structures Operating
Role of OS in virtual memory management
Role of OS in virtual memory management Role of OS memory management Design of memory-management portion of OS depends on 3 fundamental areas of choice Whether to use virtual memory or not Whether to use
4.1 Paging suffers from and Segmentation suffers from. Ans
Worked out Examples 4.1 Paging suffers from and Segmentation suffers from. Ans: Internal Fragmentation, External Fragmentation 4.2 Which of the following is/are fastest memory allocation policy? a. First
Chapter 9: Virtual Memory. Operating System Concepts 9th Edition
Chapter 9: Virtual Memory Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating Kernel Memory Other Considerations
Operating System - Virtual Memory
Operating System - Virtual Memory Virtual memory is a technique that allows the execution of processes which are not completely available in memory. The main visible advantage of this scheme is that programs