Chapter 8: Memory Management!
|
|
|
- Margery Goodman
- 7 years ago
- Views:
Transcription
1 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 appears, you may have to delete the image and then insert it again. Chapter 8: Memory Management!
2 Chapter 8: Memory Management! Background" Swapping " Contiguous Allocation" Paging" Segmentation" Segmentation with Paging" 8.2! Silberschatz, Galvin and Gagne 2005!
3 Background! Program must be brought into memory and placed within a process for it to be run" " Input queue or job queue collection of processes on the disk that are waiting to be brought into memory to run the program" " User programs go through several steps before being run" 8.3! Silberschatz, Galvin and Gagne 2005!
4 Binding of Instructions and Data to Memory! Address binding of instructions and data to memory addresses can happen at three different stages" Compile time: If memory location known a priori, absolute code can be generated; must recompile code if starting location changes" Load time: Must generate relocatable code if memory location is not known at compile time" Execution time: Binding delayed until run time if the process can be moved during its execution from one memory segment to another. Need hardware support for address maps (e.g., base and limit registers). " 8.4! Silberschatz, Galvin and Gagne 2005!
5 Multistep Processing of a User Program! 8.5! Silberschatz, Galvin and Gagne 2005!
6 Logical vs. Physical Address Space! The concept of a logical address space that is bound to a separate physical address space is central to proper memory management" Logical address generated by the CPU; also referred to as virtual address" Physical address address seen by the memory unit" Logical and physical addresses are the same in compile-time and load-time address-binding schemes; logical (virtual) and physical addresses differ in execution-time address-binding scheme" 8.6! Silberschatz, Galvin and Gagne 2005!
7 Memory-Management Unit (MMU)! Hardware device that maps virtual to physical address " In MMU scheme, the value in the relocation register is added to every address generated by a user process at the time it is sent to memory " The user program deals with logical addresses; it never sees the real physical addresses" 8.7! Silberschatz, Galvin and Gagne 2005!
8 Dynamic relocation using a relocation register! 8.8! Silberschatz, Galvin and Gagne 2005!
9 Swapping! A process can be swapped temporarily out of memory to a backing store, and then brought back into memory for continued execution " Backing store fast disk large enough to accommodate copies of all memory images for all users; must provide direct access to these memory images " Roll out, roll in swapping variant used for priority-based scheduling algorithms; lower-priority process is swapped out so higher-priority process can be loaded and executed " Major part of swap time is transfer time; total transfer time is directly proportional to the amount of memory swapped " Modified versions of swapping are found on many systems (i.e., UNIX, Linux, and Windows)" 8.9! Silberschatz, Galvin and Gagne 2005!
10 Schematic View of Swapping! 8.10! Silberschatz, Galvin and Gagne 2005!
11 Demand Paging! Bring a page into memory only when it is needed" Less I/O needed" Less memory needed " Faster response" More users " Page is needed reference to it" invalid reference abort" not-in-memory bring to memory" " 8.11! Silberschatz, Galvin and Gagne 2005!
12 Transfer of a Paged Memory to Contiguous Disk Space! 8.12! Silberschatz, Galvin and Gagne 2005!
13 Valid-Invalid Bit! With each page table entry a valid invalid bit is associated (1 in-memory, 0 not-in-memory)" Initially valid invalid but is set to 0 on all entries" Example of a page table snapshot: Frame #" valid-invalid bit" 1" 1" 1" 1" 0"!" 0" 0" page table" " During address translation, if valid invalid bit in page table entry is 0 page fault" 8.13! Silberschatz, Galvin and Gagne 2005!
14 Page Table When Some Pages Are Not in Main Memory! 8.14! Silberschatz, Galvin and Gagne 2005!
15 Steps in Handling a Page Fault! 8.15! Silberschatz, Galvin and Gagne 2005!
16 What happens if there is no free frame?! Page replacement find some page in memory, but not really in use, swap it out" algorithm" performance want an algorithm which will result in minimum number of page faults" Same page may be brought into memory several times" 8.16! Silberschatz, Galvin and Gagne 2005!
17 Memory Allocations! 8.17! Silberschatz, Galvin and Gagne 2005!
18 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 " Each (Single-partition) allocation" Relocation-register scheme used to protect user processes from each other, and from changing operating-system code and data" Relocation register contains value of smallest physical address; limit register contains range of logical addresses each logical address must be less than the limit register " 8.18! Silberschatz, Galvin and Gagne 2005!
19 A base and a limit register define a logical address space! 8.19! Silberschatz, Galvin and Gagne 2005!
20 HW address protection with base and limit registers! 8.20! Silberschatz, Galvin and Gagne 2005!
21 Contiguous Allocation (Cont.)! Multiple-partition allocation" Hole block of available memory; holes of various size are scattered throughout memory" When a process arrives, it is allocated memory from a hole large enough to accommodate it" Operating system maintains information about: a) allocated partitions b) free partitions (hole)" OS" OS" OS" OS" process 5" process 5" process 5" process 5" process 9" process 9" process 8" process 10" process 2" process 2" process 2" process 2" 8.21! Silberschatz, Galvin and Gagne 2005!
22 Dynamic Storage-Allocation Problem! How to satisfy a request of size n from a list of free holes" First-fit: Allocate the first hole that is big enough" Best-fit: Allocate the smallest hole that is big enough; must search entire list, unless ordered by size. Produces the smallest leftover hole." Worst-fit: Allocate the largest hole; must also search entire list. Produces the largest leftover hole." First-fit and best-fit better than worst-fit in terms of speed and storage utilization" 8.22! Silberschatz, Galvin and Gagne 2005!
23 Example! Given free memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 212K, 417K, 112K, and 426K (in order)? " Which algorithm makes the most efficient use of memory? " 8.23! Silberschatz, Galvin and Gagne 2005!
24 Fragmentation! External Fragmentation Gaps between allocated contiguous memory - total memory space exists to satisfy a request, but it is not contiguous" Internal Fragmentation allocated memory may be slightly larger than requested memory; this size difference is memory internal to a partition, but not being used" Reduce external fragmentation by compaction! Shuffle memory contents to place all free memory together in one large block" Compaction is possible only if relocation is dynamic, and is done at execution time" I/O problem"! Latch job in memory while it is involved in I/O"! Do I/O only into OS buffers" 8.24! Silberschatz, Galvin and Gagne 2005!
25 Paging! Logical address space of a process can be noncontiguous; process is allocated physical memory whenever the latter is available" Divide physical memory into fixed-sized blocks called frames (size is power of 2, between 512 bytes and 8192 bytes)" Divide logical memory into blocks of same size called pages." Keep track of all free frames" To run a program of size n pages, need to find n free frames and load program" Set up a page table to translate logical to physical addresses" Internal fragmentation" 8.25! Silberschatz, Galvin and Gagne 2005!
26 Address Translation Scheme! Address generated by CPU is divided into: " Page number (p) used as an index into a page table which contains 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" 8.26! Silberschatz, Galvin and Gagne 2005!
27 Address Translation Architecture! V" V" I" 8.27! Silberschatz, Galvin and Gagne 2005!
28 Paging Example! 8.28! Silberschatz, Galvin and Gagne 2005!
29 Paging Example! 8.29! Silberschatz, Galvin and Gagne 2005!
30 Free Frames! Before allocation" After allocation" 8.30! Silberschatz, Galvin and Gagne 2005!
31 Implementation of Page Table! Page table is kept in main memory" Page-table base register (PTBR) points to the page table" Page-table length register (PRLR) indicates size of the page table" In this scheme every data/instruction access requires two memory accesses. One for the page table and one for the data/instruction." The two memory access problem can be solved by the use of a special fast-lookup hardware cache called associative memory or translation look-aside buffers (TLBs)! 8.31! Silberschatz, Galvin and Gagne 2005!
32 Associative Memory! Associative memory parallel search " Page #" Frame #" "Address translation (A, A )" If A is in associative register, get frame # out" Otherwise get frame # from page table in memory" 8.32! Silberschatz, Galvin and Gagne 2005!
33 Paging Hardware With TLB! Associate Memory" 8.33! Silberschatz, Galvin and Gagne 2005!
34 Effective Access Time! Associative Lookup = ε time unit" Assume memory cycle time is 1 microsecond" Hit ratio percentage of times that a page number is found in the associative registers; ration related to number of associative registers" Hit ratio = α" Effective Access Time (EAT)" " " "EAT = (1 + ε) α + (2 + ε)(1 α)" " " "= 2 + ε α" 8.34! Silberschatz, Galvin and Gagne 2005!
35 Memory Protection! Memory protection implemented by associating protection bit with each frame " Valid-invalid bit attached to each entry in the page table:" valid indicates that the associated page is in the process logical address space, and is thus a legal page" invalid indicates that the page is not in the process logical address space" 8.35! Silberschatz, Galvin and Gagne 2005!
36 Valid (v) or Invalid (i) Bit In A Page Table! 8.36! Silberschatz, Galvin and Gagne 2005!
37 Swapping! 8.37! Silberschatz, Galvin and Gagne 2005!
38 Virtual Memory! Elusion to expand memory view onto the secondary storage." Moving pages frames between memory and HD" Demand paging" 8.38! Silberschatz, Galvin and Gagne 2005!
39 Demand Paging! Bring a page into memory only when it is needed" Less I/O needed" Less memory needed " Faster response" More users " Page is needed reference to it" invalid reference abort" not-in-memory bring to memory" " 8.39! Silberschatz, Galvin and Gagne 2005!
40 Transfer of a Paged Memory to Contiguous Disk Space! 8.40! Silberschatz, Galvin and Gagne 2005!
41 Valid-Invalid Bit! With each page table entry a valid invalid bit is associated (1 in-memory, 0 not-in-memory)" Initially valid invalid but is set to 0 on all entries" Example of a page table snapshot: Frame #" valid-invalid bit" 1" 1" 1" 1" 0"!" 0" 0" page table" " During address translation, if valid invalid bit in page table entry is 0 page fault" 8.41! Silberschatz, Galvin and Gagne 2005!
42 Page Table When Some Pages Are Not in Main Memory! 8.42! Silberschatz, Galvin and Gagne 2005!
43 Steps in Handling a Page Fault! 8.43! Silberschatz, Galvin and Gagne 2005!
44 What happens if there is no free frame?! Page replacement find some page in memory, but not really in use, swap it out" algorithm" performance want an algorithm which will result in minimum number of page faults" Same page may be brought into memory several times" 8.44! Silberschatz, Galvin and Gagne 2005!
45 Page Table Structure! Hierarchical Paging" Hashed Page Tables" Inverted Page Tables" 8.45! Silberschatz, Galvin and Gagne 2005!
46 Hierarchical Page Tables! Break up the logical address space into multiple page tables" A simple technique is a two-level page table" 8.46! Silberschatz, Galvin and Gagne 2005!
47 Two-Level Paging Example! A logical address (on 32-bit machine with 4K page size) is divided into:" a page number consisting of 20 bits" a page offset consisting of 12 bits" Since the page table is paged, the page number is further divided into:" a 10-bit page number " a 10-bit page offset" Thus, a logical address is as follows: page number" p i " p 2 " d" page offset" 10" 10" 12" where p i is an index into the outer page table, and p 2 is the displacement within the page of the outer page table" 8.47! Silberschatz, Galvin and Gagne 2005!
48 Two-Level Page-Table Scheme! 8.48! Silberschatz, Galvin and Gagne 2005!
49 Address-Translation Scheme! Address-translation scheme for a two-level 32-bit paging architecture" 8.49! Silberschatz, Galvin and Gagne 2005!
50 Stop here! 8.50! Silberschatz, Galvin and Gagne 2005!
51 Hashed Page Tables! Common in address spaces > 32 bits" The virtual page number is hashed into a page table. This page table contains a chain of elements hashing to the same location." Virtual page numbers are compared in this chain searching for a match. If a match is found, the corresponding physical frame is extracted." 8.51! Silberschatz, Galvin and Gagne 2005!
52 Hashed Page Table! 8.52! Silberschatz, Galvin and Gagne 2005!
53 Inverted Page Table! One entry for each real page of memory" Entry consists of the virtual address of the page stored in that real memory location, with information about the process that owns that page" Decreases memory needed to store each page table, but increases time needed to search the table when a page reference occurs" Use hash table to limit the search to one or at most a few page-table entries" 8.53! Silberschatz, Galvin and Gagne 2005!
54 Inverted Page Table Architecture! 8.54! Silberschatz, Galvin and Gagne 2005!
55 Shared Pages! Shared code! One copy of read-only (reentrant) code shared among processes (i.e., text editors, compilers, window systems)." Shared code must appear in same location in the logical address space of all processes " Private code and data " Each process keeps a separate copy of the code and data" The pages for the private code and data can appear anywhere in the logical address space" 8.55! Silberschatz, Galvin and Gagne 2005!
56 Shared Pages Example! 8.56! Silberschatz, Galvin and Gagne 2005!
57 Segmentation! Memory-management scheme that supports user view of memory " A program is a collection of segments. A segment is a logical unit such as:" " "main program," " "procedure, " " "function," " "method," " "object," " "local variables, global variables," " "common block," " "stack," " "symbol table, arrays" 8.57! Silberschatz, Galvin and Gagne 2005!
58 User s View of a Program! 8.58! Silberschatz, Galvin and Gagne 2005!
59 Logical View of Segmentation! 1" 1" 4" 2" 3" 4" 2" 3" user space " physical memory space" 8.59! Silberschatz, Galvin and Gagne 2005!
60 Stop here! 8.60! Silberschatz, Galvin and Gagne 2005!
61 Segmentation Architecture! Logical address consists of a two tuple:" " "<segment-number, offset>," 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" Segment-table base register (STBR) points to the segment table s location in memory" Segment-table length register (STLR) indicates number of segments used by a program;" " segment number s is legal if s < STLR" 8.61! Silberschatz, Galvin and Gagne 2005!
62 Segmentation Architecture (Cont.)! Relocation." dynamic" by segment table " Sharing." shared segments" same segment number " Allocation." first fit/best fit" external fragmentation" 8.62! Silberschatz, Galvin and Gagne 2005!
63 Segmentation Architecture (Cont.)! Protection. With each entry in segment table associate:" validation bit = 0 illegal segment" read/write/execute privileges" Protection bits associated with segments; code sharing occurs at segment level" Since segments vary in length, memory allocation is a dynamic storage-allocation problem" A segmentation example is shown in the following diagram" 8.63! Silberschatz, Galvin and Gagne 2005!
64 Address Translation Architecture! 8.64! Silberschatz, Galvin and Gagne 2005!
65 Example of Segmentation! 8.65! Silberschatz, Galvin and Gagne 2005!
66 Sharing of Segments! 8.66! Silberschatz, Galvin and Gagne 2005!
67 Segmentation with Paging MULTICS! The MULTICS system solved problems of external fragmentation and lengthy search times by paging the segments " Solution differs from pure segmentation in that the segment-table entry contains not the base address of the segment, but rather the base address of a page table for this segment" 8.67! Silberschatz, Galvin and Gagne 2005!
68 MULTICS Address Translation Scheme! 8.68! Silberschatz, Galvin and Gagne 2005!
69 Segmentation with Paging Intel 386! As shown in the following diagram, the Intel 386 uses segmentation with paging for memory management with a two-level paging scheme" 8.69! Silberschatz, Galvin and Gagne 2005!
70 Intel Address Translation! 8.70! Silberschatz, Galvin and Gagne 2005!
71 Linux on Intel 80x86! Uses minimal segmentation to keep memory management implementation more portable" Uses 6 segments:" Kernel code" Kernel data" User code (shared by all user processes, using logical addresses)" User data (likewise shared)" Task-state (per-process hardware context)" LDT" Uses 2 protection levels:" Kernel mode" User mode" 8.71! Silberschatz, Galvin and Gagne 2005!
72 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 appears, you may have to delete the image and then insert it again. End of Chapter 8!
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
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
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
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
Chapter 11: File System Implementation. Chapter 11: File System Implementation. Objectives. File-System Structure
Chapter 11: File System Implementation Chapter 11: File System Implementation File-System Structure File-System Implementation Directory Implementation Allocation Methods Free-Space Management Efficiency
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
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
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
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
Virtual vs Physical Addresses
Virtual vs Physical Addresses Physical addresses refer to hardware addresses of physical memory. Virtual addresses refer to the virtual store viewed by the process. virtual addresses might be the same
W4118: segmentation and paging. Instructor: Junfeng Yang
W4118: segmentation and paging Instructor: Junfeng Yang Outline Memory management goals Segmentation Paging TLB 1 Uni- v.s. multi-programming Simple uniprogramming with a single segment per process Uniprogramming
Chapter 11: File System Implementation. Operating System Concepts with Java 8 th Edition
Chapter 11: File System Implementation 11.1 Silberschatz, Galvin and Gagne 2009 Chapter 11: File System Implementation File-System Structure File-System Implementation Directory Implementation Allocation
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
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.
CS 61C: Great Ideas in Computer Architecture Virtual Memory Cont.
CS 61C: Great Ideas in Computer Architecture Virtual Memory Cont. Instructors: Vladimir Stojanovic & Nicholas Weaver http://inst.eecs.berkeley.edu/~cs61c/ 1 Bare 5-Stage Pipeline Physical Address PC Inst.
COS 318: Operating Systems. Virtual Memory and Address Translation
COS 318: Operating Systems Virtual Memory and Address Translation Today s Topics Midterm Results Virtual Memory Virtualization Protection Address Translation Base and bound Segmentation Paging Translation
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
Two Parts. Filesystem Interface. Filesystem design. Interface the user sees. Implementing the interface
File Management Two Parts Filesystem Interface Interface the user sees Organization of the files as seen by the user Operations defined on files Properties that can be read/modified Filesystem design Implementing
Lecture 17: Virtual Memory II. Goals of virtual memory
Lecture 17: Virtual Memory II Last Lecture: Introduction to virtual memory Today Review and continue virtual memory discussion Lecture 17 1 Goals of virtual memory Make it appear as if each process has:
Chapter 12. Paging an Virtual Memory Systems
Chapter 12 Paging an Virtual Memory Systems Paging & Virtual Memory Virtual Memory - giving the illusion of more physical memory than there really is (via demand paging) Pure Paging - The total program
Computer-System Architecture
Chapter 2: Computer-System Structures Computer System Operation I/O Structure Storage Structure Storage Hierarchy Hardware Protection General System Architecture 2.1 Computer-System Architecture 2.2 Computer-System
Chapter 11: File System Implementation. Operating System Concepts 8 th Edition
Chapter 11: File System Implementation Operating System Concepts 8 th Edition Silberschatz, Galvin and Gagne 2009 Chapter 11: File System Implementation File-System Structure File-System Implementation
Outline: Operating Systems
Outline: Operating Systems What is an OS OS Functions Multitasking Virtual Memory File Systems Window systems PC Operating System Wars: Windows vs. Linux 1 Operating System provides a way to boot (start)
Virtual Memory. Virtual Memory. Paging. CSE 380 Computer Operating Systems. Paging (1)
Virtual Memory CSE 380 Computer Operating Systems Instructor: Insup Lee University of Pennsylvania Fall 2003 Lecture Note: Virtual Memory (revised version) 1 Recall: memory allocation with variable partitions
Operating System Tutorial
Operating System Tutorial OPERATING SYSTEM TUTORIAL Simply Easy Learning by tutorialspoint.com tutorialspoint.com i ABOUT THE TUTORIAL Operating System Tutorial An operating system (OS) is a collection
Virtual Machines. COMP 3361: Operating Systems I Winter 2015 http://www.cs.du.edu/3361
s COMP 3361: Operating Systems I Winter 2015 http://www.cs.du.edu/3361 1 Virtualization! Create illusion of multiple machines on the same physical hardware! Single computer hosts multiple virtual machines
OPERATING SYSTEM - VIRTUAL MEMORY
OPERATING SYSTEM - VIRTUAL MEMORY http://www.tutorialspoint.com/operating_system/os_virtual_memory.htm Copyright tutorialspoint.com A computer can address more memory than the amount physically installed
Operating Systems 4 th Class
Operating Systems 4 th Class Lecture 1 Operating Systems Operating systems are essential part of any computer system. Therefore, a course in operating systems is an essential part of any computer science
CHAPTER 17: File Management
CHAPTER 17: File Management The Architecture of Computer Hardware, Systems Software & Networking: An Information Technology Approach 4th Edition, Irv Englander John Wiley and Sons 2010 PowerPoint slides
Technical Properties. Mobile Operating Systems. Overview Concepts of Mobile. Functions Processes. Lecture 11. Memory Management.
Overview Concepts of Mobile Operating Systems Lecture 11 Concepts of Mobile Operating Systems Mobile Business I (WS 2007/08) Prof Dr Kai Rannenberg Chair of Mobile Business and Multilateral Security Johann
Devices and Device Controllers
I/O 1 Devices and Device Controllers network interface graphics adapter secondary storage (disks, tape) and storage controllers serial (e.g., mouse, keyboard) sound co-processors... I/O 2 Bus Architecture
Chapter 3 Operating-System Structures
Contents 1. Introduction 2. Computer-System Structures 3. Operating-System Structures 4. Processes 5. Threads 6. CPU Scheduling 7. Process Synchronization 8. Deadlocks 9. Memory Management 10. Virtual
Chapter 11 I/O Management and Disk Scheduling
Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 11 I/O Management and Disk Scheduling Dave Bremer Otago Polytechnic, NZ 2008, Prentice Hall I/O Devices Roadmap Organization
Disk Space Management Methods
Volume 1, Issue 1, June 2013 International Journal of Advance Research in Computer Science and Management Studies Research Paper Available online at: www.ijarcsms.com Disk Space Management Methods Ramakrishna
How To Write A Page Table
12 Paging: Introduction Remember our goal: to virtualize memory. Segmentation (a generalization of dynamic relocation) helped us do this, but has some problems; in particular, managing free space becomes
Operating Systems CSE 410, Spring 2004. File Management. Stephen Wagner Michigan State University
Operating Systems CSE 410, Spring 2004 File Management Stephen Wagner Michigan State University File Management File management system has traditionally been considered part of the operating system. Applications
Chapter 16: Virtual Machines. Operating System Concepts 9 th Edition
Chapter 16: Virtual Machines Silberschatz, Galvin and Gagne 2013 Chapter 16: Virtual Machines Overview History Benefits and Features Building Blocks Types of Virtual Machines and Their Implementations
Operating System Overview. Otto J. Anshus
Operating System Overview Otto J. Anshus A Typical Computer CPU... CPU Memory Chipset I/O bus ROM Keyboard Network A Typical Computer System CPU. CPU Memory Application(s) Operating System ROM OS Apps
& 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
Chapter 3: Operating-System Structures. System Components Operating System Services System Calls System Programs System Structure Virtual Machines
Chapter 3: Operating-System Structures System Components Operating System Services System Calls System Programs System Structure Virtual Machines Operating System Concepts 3.1 Common System Components
Part III Storage Management. Chapter 11: File System Implementation
Part III Storage Management Chapter 11: File System Implementation 1 Layered File System 2 Overview: 1/4 A file system has on-disk and in-memory information. A disk may contain the following for implementing
1 File Management. 1.1 Naming. COMP 242 Class Notes Section 6: File Management
COMP 242 Class Notes Section 6: File Management 1 File Management We shall now examine how an operating system provides file management. We shall define a file to be a collection of permanent data with
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
CS420: Operating Systems OS Services & System Calls
NK YORK COLLEGE OF PENNSYLVANIA HG OK 2 YORK COLLEGE OF PENNSYLVAN OS Services & System Calls James Moscola Department of Physical Sciences York College of Pennsylvania Based on Operating System Concepts,
Peter J. Denning, Naval Postgraduate School, Monterey, California
VIRTUAL MEMORY Peter J. Denning, Naval Postgraduate School, Monterey, California January 2008 Rev 6/5/08 Abstract: Virtual memory is the simulation of a storage space so large that users do not need to
Chapter 2: Computer-System Structures. Computer System Operation Storage Structure Storage Hierarchy Hardware Protection General System Architecture
Chapter 2: Computer-System Structures Computer System Operation Storage Structure Storage Hierarchy Hardware Protection General System Architecture Operating System Concepts 2.1 Computer-System Architecture
Operating Systems. Virtual Memory
Operating Systems Virtual Memory Virtual Memory Topics. Memory Hierarchy. Why Virtual Memory. Virtual Memory Issues. Virtual Memory Solutions. Locality of Reference. Virtual Memory with Segmentation. Page
Convenience: An OS makes a computer more convenient to use. Efficiency: An OS allows the computer system resources to be used in an efficient manner.
Introduction to Operating System PCSC-301 (For UG students) (Class notes and reference books are required to complete this study) Release Date: 27.12.2014 Operating System Objectives and Functions An OS
CS 377: Operating Systems. Outline. A review of what you ve learned, and how it applies to a real operating system. Lecture 25 - Linux Case Study
CS 377: Operating Systems Lecture 25 - Linux Case Study Guest Lecturer: Tim Wood Outline Linux History Design Principles System Overview Process Scheduling Memory Management File Systems A review of what
Operating Systems. Steven Hand. Michaelmas / Lent Term 2008/09. 17 lectures for CST IA. Handout 3. Operating Systems N/H/MWF@12
Operating Systems Steven Hand Michaelmas / Lent Term 2008/09 17 lectures for CST IA Handout 3 Operating Systems N/H/MWF@12 What is an Operating System? A program which controls the execution of all other
Chapter 12 File Management. Roadmap
Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 12 File Management Dave Bremer Otago Polytechnic, N.Z. 2008, Prentice Hall Overview Roadmap File organisation and Access
Chapter 12 File Management
Operating Systems: Internals and Design Principles, 6/E William Stallings Chapter 12 File Management Dave Bremer Otago Polytechnic, N.Z. 2008, Prentice Hall Roadmap Overview File organisation and Access
Virtualization in Linux KVM + QEMU
CS695 Topics in Virtualization and Cloud Computing KVM + QEMU Senthil, Puru, Prateek and Shashank 1 Topics covered KVM and QEMU Architecture VTx support CPU virtualization in KMV Memory virtualization
Chapter 19: Real-Time Systems. Overview of Real-Time Systems. Objectives. System Characteristics. Features of Real-Time Systems
Chapter 19: Real-Time Systems System Characteristics Features of Real-Time Systems Chapter 19: Real-Time Systems Implementing Real-Time Operating Systems Real-Time CPU Scheduling VxWorks 5.x 19.2 Silberschatz,
Memory management. Chapter 4: Memory Management. Memory hierarchy. In an ideal world. Basic memory management. Fixed partitions: multiple programs
Memory management Chater : Memory Management Part : Mechanisms for Managing Memory asic management Swaing Virtual Page relacement algorithms Modeling age relacement algorithms Design issues for aging systems
Computer Science 4302 Operating Systems. Student Learning Outcomes
Computer Science 4302 Operating Systems Student Learning Outcomes 1. The student will learn what operating systems are, what they do, and how they are designed and constructed. The student will be introduced
Chapter 13 File and Database Systems
Chapter 13 File and Database Systems Outline 13.1 Introduction 13.2 Data Hierarchy 13.3 Files 13.4 File Systems 13.4.1 Directories 13.4. Metadata 13.4. Mounting 13.5 File Organization 13.6 File Allocation
Chapter 13 File and Database Systems
Chapter 13 File and Database Systems Outline 13.1 Introduction 13.2 Data Hierarchy 13.3 Files 13.4 File Systems 13.4.1 Directories 13.4. Metadata 13.4. Mounting 13.5 File Organization 13.6 File Allocation
Chapter 7: Deadlocks!
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
Chapter 1 8 Essay Question Review
Chapter 1 8 Essay Question Review 1. Explain why an operating system can be viewed as a resource allocator. Ans: A computer system has many resources that may be required to solve a problem: CPU time,
Lesson Objectives. To provide a grand tour of the major operating systems components To provide coverage of basic computer system organization
Lesson Objectives To provide a grand tour of the major operating systems components To provide coverage of basic computer system organization AE3B33OSD Lesson 1 / Page 2 What is an Operating System? A
Operating Systems. Lecture 03. February 11, 2013
Operating Systems Lecture 03 February 11, 2013 Goals for Today Interrupts, traps and signals Hardware Protection System Calls Interrupts, Traps, and Signals The occurrence of an event is usually signaled
Objectives. Chapter 5: Process Scheduling. Chapter 5: Process Scheduling. 5.1 Basic Concepts. To introduce CPU scheduling
Objectives To introduce CPU scheduling To describe various CPU-scheduling algorithms Chapter 5: Process Scheduling To discuss evaluation criteria for selecting the CPUscheduling algorithm for a particular
This tutorial will take you through step by step approach while learning Operating System concepts.
About the Tutorial An operating system (OS) is a collection of software that manages computer hardware resources and provides common services for computer programs. The operating system is a vital component
POSIX. RTOSes Part I. POSIX Versions. POSIX Versions (2)
RTOSes Part I Christopher Kenna September 24, 2010 POSIX Portable Operating System for UnIX Application portability at source-code level POSIX Family formally known as IEEE 1003 Originally 17 separate
Objectives. Chapter 2: Operating-System Structures. Operating System Services (Cont.) Operating System Services. Operating System Services (Cont.
Objectives To describe the services an operating system provides to users, processes, and other systems To discuss the various ways of structuring an operating system Chapter 2: Operating-System Structures
Operating Systems OBJECTIVES 7.1 DEFINITION. Chapter 7. Note:
Chapter 7 OBJECTIVES Operating Systems Define the purpose and functions of an operating system. Understand the components of an operating system. Understand the concept of virtual memory. Understand the
Full and Para Virtualization
Full and Para Virtualization Dr. Sanjay P. Ahuja, Ph.D. 2010-14 FIS Distinguished Professor of Computer Science School of Computing, UNF x86 Hardware Virtualization The x86 architecture offers four levels
Board Notes on Virtual Memory
Board Notes on Virtual Memory Part A: Why Virtual Memory? - Letʼs user program size exceed the size of the physical address space - Supports protection o Donʼt know which program might share memory at
Microkernels, virtualization, exokernels. Tutorial 1 CSC469
Microkernels, virtualization, exokernels Tutorial 1 CSC469 Monolithic kernel vs Microkernel Monolithic OS kernel Application VFS System call User mode What was the main idea? What were the problems? IPC,
Segmentation. 16.1 Segmentation: Generalized Base/Bounds
16 Segmentation So far we have been putting the entire address space of each process in memory. With the base and bounds registers, the OS can easily relocate processes to different parts of physical memory.
Chapter 1 13 Essay Question Review
Chapter 1 13 Essay Question Review Chapter 1 1. Explain why an operating system can be viewed as a resource allocator. Ans: A computer system has many resources that may be required to solve a problem:
CS3600 SYSTEMS AND NETWORKS
CS3600 SYSTEMS AND NETWORKS NORTHEASTERN UNIVERSITY Lecture 2: Operating System Structures Prof. Alan Mislove (amislove@ccs.neu.edu) Operating System Services Operating systems provide an environment for
Operating System for the K computer
Operating System for the K computer Jun Moroo Masahiko Yamada Takeharu Kato For the K computer to achieve the world s highest performance, Fujitsu has worked on the following three performance improvements
COS 318: Operating Systems
COS 318: Operating Systems OS Structures and System Calls Andy Bavier Computer Science Department Princeton University http://www.cs.princeton.edu/courses/archive/fall10/cos318/ Outline Protection mechanisms
Memory Allocation. Static Allocation. Dynamic Allocation. Memory Management. Dynamic Allocation. Dynamic Storage Allocation
Dynamic Storage Allocation CS 44 Operating Systems Fall 5 Presented By Vibha Prasad Memory Allocation Static Allocation (fixed in size) Sometimes we create data structures that are fixed and don t need
Memory Management CS 217. Two programs can t control all of memory simultaneously
Memory Management CS 217 Memory Management Problem 1: Two programs can t control all of memory simultaneously Problem 2: One program shouldn t be allowed to access/change the memory of another program
Virtual Memory. How is it possible for each process to have contiguous addresses and so many of them? A System Using Virtual Addressing
How is it possible for each process to have contiguous addresses and so many of them? Computer Systems Organization (Spring ) CSCI-UA, Section Instructor: Joanna Klukowska Teaching Assistants: Paige Connelly
IOMMU: A Detailed view
12/1/14 Security Level: Security Level: IOMMU: A Detailed view Anurup M. Sanil Kumar D. Nov, 2014 HUAWEI TECHNOLOGIES CO., LTD. Contents n IOMMU Introduction n IOMMU for ARM n Use cases n Software Architecture
1. Computer System Structure and Components
1 Computer System Structure and Components Computer System Layers Various Computer Programs OS System Calls (eg, fork, execv, write, etc) KERNEL/Behavior or CPU Device Drivers Device Controllers Devices
Operating System Structures
Operating System Structures Meelis ROOS mroos@ut.ee Institute of Computer Science Tartu University fall 2009 Literature A. S. Tanenbaum. Modern Operating Systems. 2nd ed. Prentice Hall. 2001. G. Nutt.
How To Write A Virtual Machine (Or \"Virtual Machine\") On A Microsoft Linux Operating System (Or Microsoft) (Or Linux) ( Or Microsoft Microsoft Operating System) (For A Non-Power Os) (On A
Operating Systems Steven Hand Michaelmas Term 2010 12 lectures for CST IA Operating Systems N/H/MWF@12 Course Aims This course aims to: explain the structure and functions of an operating system, illustrate
An Introduction to Computer Science and Computer Organization Comp 150 Fall 2008
An Introduction to Computer Science and Computer Organization Comp 150 Fall 2008 Computer Science the study of algorithms, including Their formal and mathematical properties Their hardware realizations
Chapter 11 I/O Management and Disk Scheduling
Operatin g Systems: Internals and Design Principle s Chapter 11 I/O Management and Disk Scheduling Seventh Edition By William Stallings Operating Systems: Internals and Design Principles An artifact can
Operating System Components
Lecture Overview Operating system software introduction OS components OS services OS structure Operating Systems - April 24, 2001 Operating System Components Process management Memory management Secondary
OS OBJECTIVE QUESTIONS
OS OBJECTIVE QUESTIONS Which one of the following is Little s formula Where n is the average queue length, W is the time that a process waits 1)n=Lambda*W 2)n=Lambda/W 3)n=Lambda^W 4)n=Lambda*(W-n) Answer:1
Advanced Computer Architecture-CS501. Computer Systems Design and Architecture 2.1, 2.2, 3.2
Lecture Handout Computer Architecture Lecture No. 2 Reading Material Vincent P. Heuring&Harry F. Jordan Chapter 2,Chapter3 Computer Systems Design and Architecture 2.1, 2.2, 3.2 Summary 1) A taxonomy of
Filing Systems. Filing Systems
Filing Systems At the outset we identified long-term storage as desirable characteristic of an OS. EG: On-line storage for an MIS. Convenience of not having to re-write programs. Sharing of data in an
CSC 2405: Computer Systems II
CSC 2405: Computer Systems II Spring 2013 (TR 8:30-9:45 in G86) Mirela Damian http://www.csc.villanova.edu/~mdamian/csc2405/ Introductions Mirela Damian Room 167A in the Mendel Science Building mirela.damian@villanova.edu
Computer Architecture
Computer Architecture Slide Sets WS 2013/2014 Prof. Dr. Uwe Brinkschulte M.Sc. Benjamin Betting Part 11 Memory Management Computer Architecture Part 11 page 1 of 44 Prof. Dr. Uwe Brinkschulte, M.Sc. Benjamin
Virtualization. Explain how today s virtualization movement is actually a reinvention
Virtualization Learning Objectives Explain how today s virtualization movement is actually a reinvention of the past. Explain how virtualization works. Discuss the technical challenges to virtualization.
Uses for Virtual Machines. Virtual Machines. There are several uses for virtual machines:
Virtual Machines Uses for Virtual Machines Virtual machine technology, often just called virtualization, makes one computer behave as several computers by sharing the resources of a single computer between
I/O Management. General Computer Architecture. Goals for I/O. Levels of I/O. Naming. I/O Management. COMP755 Advanced Operating Systems 1
General Computer Architecture I/O Management COMP755 Advanced Operating Systems Goals for I/O Users should access all devices in a uniform manner. Devices should be named in a uniform manner. The OS, without
Chapter 3: Operating-System Structures. Common System Components
Chapter 3: Operating-System Structures System Components Operating System Services System Calls System Programs System Structure Virtual Machines System Design and Implementation System Generation 3.1
Physical Data Organization
Physical Data Organization Database design using logical model of the database - appropriate level for users to focus on - user independence from implementation details Performance - other major factor
We r e going to play Final (exam) Jeopardy! "Answers:" "Questions:" - 1 -
. (0 pts) We re going to play Final (exam) Jeopardy! Associate the following answers with the appropriate question. (You are given the "answers": Pick the "question" that goes best with each "answer".)
Secondary Storage. Any modern computer system will incorporate (at least) two levels of storage: magnetic disk/optical devices/tape systems
1 Any modern computer system will incorporate (at least) two levels of storage: primary storage: typical capacity cost per MB $3. typical access time burst transfer rate?? secondary storage: typical capacity
COS 318: Operating Systems. File Layout and Directories. Topics. File System Components. Steps to Open A File
Topics COS 318: Operating Systems File Layout and Directories File system structure Disk allocation and i-nodes Directory and link implementations Physical layout for performance 2 File System Components