Sarah Diesburg Operating Systems CS 3430

Slides:

Advertisements

Similar presentations

OPERATING SYSTEMS 11 - DISK PIETER HARTEL 1. Hardware Intended for humans, local devices and communication (challenge?) Hardware support for interrupts.

Advertisements

CS Introduction to Operating Systems

4.4 Page replacement algorithms

Page Replacement Algorithms

ARC: A SELF-TUNING, LOW OVERHEAD REPLACEMENT CACHE

1 Cache and Caching David Sands CS 147 Spring 08 Dr. Sin-Min Lee.

Disk scheduling examples. Problem parameters: u Disk has 100 cylinders, labeled u Time to move from cylinder A to cylinder B is a linear function.

Operating Systems ECE344 Ding Yuan Final Review Lecture 13: Final Review.

Virtual Memory. 2 What is virtual memory? Each process has illusion of large address space –2 32 for 32-bit addressing However, physical memory is much.

Lecture 8 Memory Management. Paging Too slow -> TLB Too big -> multi-level page table What if all that stuff does not fit into memory?

Caching and Virtual Memory. Main Points Cache concept – Hardware vs. software caches When caches work and when they don’t – Spatial/temporal locality.

CS 162 Discussion Section Week 7. Recap What is demand paging?

CMPT 300: Final Review Chapters 8 – Memory Management: Ch. 8, 9 Address spaces Logical (virtual): generated by the CPU Physical: seen by the memory.

University of Pennsylvania 10/24/00CSE 3801 Disk Scheduling CSE 380 Lecture Note 11a Insup Lee.

CS 342 – Operating Systems Spring 2003 © Ibrahim Korpeoglu Bilkent University1 Memory Management – 4 Page Replacement Algorithms CS 342 – Operating Systems.

Lecture 17 I/O Optimization. Disk Organization Tracks: concentric rings around disk surface Sectors: arc of track, minimum unit of transfer Cylinder:

Disk Drivers May 10, 2000 Instructor: Gary Kimura.

Ecole Polytechnique, Nov 7, Online Job Scheduling Marek Chrobak University of California, Riverside.

Caching and Demand-Paged Virtual Memory

5/27/99 Ashish Sabharwal1 Cache Misses - The 3 C’s n Compulsory misses –cold start –don’t have a choice –except that by increasing block size, can reduce.

CS 241 Section Week #12 (04/22/10).

Caching and Virtual Memory. Main Points Cache concept – Hardware vs. software caches When caches work and when they don’t – Spatial/temporal locality.

Toolbox for Dimensioning Windows Storage Systems Jalil Boukhobza, Claude Timsit 12/09/2006 Versailles Saint Quentin University.

Exam Review cs550 Operating Systems. Preliminary Information Exam will focus on new content, but old content is still fair game. Exam format will be the.

Simulation of Memory Management Using Paging Mechanism in Operating Systems Tarek M. Sobh and Yanchun Liu Presented by: Bei Wang University of Bridgeport.

Topic: Disks – file system devices. Rotational Media Sector Track Cylinder Head Platter Arm Access time = seek time + rotational delay + transfer time.

CS 153 Design of Operating Systems Spring 2015 Final Review.

Memory Management What if pgm mem > main mem ?. Memory Management What if pgm mem > main mem ? Overlays – program controlled.

Page Replacement in Real Systems Questions answered in this lecture: How can the LRU page be approximated efficiently? How can users discover the page.

1Fall 2008, Chapter 12 Disk Hardware Arm can move in and out Read / write head can access a ring of data as the disk rotates Disk consists of one or more.

An I/O Simulator for Windows Systems Jalil Boukhobza, Claude Timsit 27/10/2004 Versailles Saint Quentin University laboratory.

Chapter 21 Virtual Memoey: Policies Chien-Chung Shen CIS, UD

I/O and Disk Scheduling CS Spring Overview Review of I/O Techniques I/O Buffering Disk Geometry Disk Scheduling Algorithms RAID.

By Andrew Yee. Virtual Memory Memory Management What is Page Replacement?

Demand Paged Virtual Memory Andy Wang Operating Systems COP 4610 / CGS 5765.

Memory Management What if pgm mem > main mem ?. Memory Management What if pgm mem > main mem ? Overlays – program controlled.

Page Replacement Algorithms and Simulation Neville Allen.

Disk Scheduling CS Introduction to Operating Systems.

Operating Systems (CS 340 D) Princess Nora University Faculty of Computer & Information Systems Computer science Department.

1 CS.217 Operating System By Ajarn..Sutapart Sappajak,METC,MSIT Chapter 13 Mass-Storage Systems Slide 1 Chapter 13 Mass-Storage Systems.

I/O Management and Disk schedule. I/O Devices DevicePurposePartnerData rate (KB/sec) KeyboardInputHuman.01 MouseInputHuman.02 Voice inputInputHuman.02.

Transforming Policies into Mechanisms with Infokernel Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau, Nathan C. Burnett, Timothy E. Denehy, Thomas J.

Problem 3.2 Paging Algorithms-Time & Space Requirements Problem:What are the space and time requirements of LIFO, LFU, and LED? LRU:(least-recently-used):

Disk Average Seek Time. Multi-platter Disk platter Disk read/write arm read/write head.

I/O Scheduling Computer Organization II 1 Disk Scheduling Carrying out disk accesses in the order they are received will not always produce optimal performance.

CSCI 6307 Foundation of Systems – Exercise (4) Xiang Lian The University of Texas – Pan American Edinburg, TX

CS422 Principles of Database Systems Buffer Management Chengyu Sun California State University, Los Angeles.

1.Why we need page replacement? 2.Basic page replacement technique. 3.Different type of page replacement algorithm and their examples.

Clustered Web Server Model

Sarah Diesburg Operating Systems CS 3430

Operating System (OS) QUESTIONS AND ANSWERS

Computer Architecture

Virtual Memory.

Secondary Storage Secondary storage typically: Characteristics:

Moving-head Disk Machanism

Demand Paged Virtual Memory

Virtual Memory فصل هشتم.

Sarah Diesburg Operating Systems CS 3430

Chap. 12 Memory Organization

Database Management Systems (CS 564)

CS 140 Lecture Notes: Demand Paging

Disk Scheduling Carrying out disk accesses in the order they are received will not always produce optimal performance. Seek time is the reason for differences.

CS 140 Lecture Notes: Demand Paging

Module IV Memory Organization.

Lecture 9: Caching and Demand-Paged Virtual Memory

Sarah Diesburg Operating Systems CS 3430

Sarah Diesburg Operating Systems COP 4610

Module IV Memory Organization.

Presentation transcript:

Sarah Diesburg Operating Systems CS 3430 Homework 6 Sarah Diesburg Operating Systems CS 3430

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO Memory page R A E F 1 * 2 3

FIFO 7 page faults Memory page R A E F 1 * 2 3

FIFO 4 compulsory cache misses Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN Memory page R A E F 1 * 2 3

MIN 6 page faults Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU Memory page R A E F 1 * 2 3

LRU 7 page faults Memory page R A E F 1 * 2 3

LFU Memory page R A E F 1 2 3

LFU Memory page R A E F 1 2 3

LFU Memory page R A E F 1 2 3

LFU Memory page R A E F 1 2 3

LFU Memory page R A E F 1 2 3

LFU Memory page R A E F 1 2 3

LFU Memory page R A E F 1 2 3 4

LFU Memory page R A E F 1 2 3 4

LFU 7 page faults Memory page R A E F 1 2 3 4

FIFO Disk Scheduling Policy Request queue: 10, 45, 52, 56, 70 Initial head position: 50 track 70 56 52 50 45 10 time

SSTF Disk Scheduling Policy Request queue: 10, 45, 52, 56, 70 Initial head position: 50 track 70 56 52 50 45 10 time

SCAN Disk Scheduling Policy Request queue: 10, 45, 52, 56, 70 Initial head position: 50 track 70 56 52 50 45 10 time

SCAN Disk Scheduling Policy Request queue: 10, 45, 52, 56, 70 Initial head position: 50 track 70 56 52 50 45 10 time

C-SCAN Disk Scheduling Policy Request queue: 10, 45, 52, 56, 70 Initial head position: 50 track 70 56 52 50 45 10 time

A Single Disk Platter With 5 Tracks from\to 1 2 3 4

A Single Disk Platter With 5 Tracks 1/25 x (0 + 1 + 2 + 3 + 4) + 1/25 x (1 + 0 + 1 + 2 + 3) + 1/25 x (2 + 1 + 0 + 1 + 2) + 1/25 x (3 + 2 + 1 + 0 + 1) + 1/25 x (4 + 3 + 2 + 1 + 0) = 1/25 x (10 + 7 + 6 + 7 + 10) = 1/25 x (20 + 14 + 6) = 40/25 = 1.6 1.6 / 5 = 0.32 ~= 1/3