Consider the page reference string R={0, 1, 2, 0, 1, 2, 0, 1, 2, 3, 6, 7, 6, 7, 0, 1, 2, 3, 4} for a given process. a) Show the memory representation of the pages using the LRU algorithm and an allocation of 3 frames. How many page faults are there? (b) Show the memory representation of the pages using the Belady Optimal algorithm and an allocation of 3 frames. How many page faults are there?

Consider the page reference string R={0, 1, 2, 0, 1, 2, 0, 1, 2, 3, 6, 7, 6, 7, 0, 1, 2, 3, 4} for a given process. a) Show the memory representation of the pages using the LRU algorithm and an allocation of 3 frames. How many page faults are there? (b) Show the memory representation of the pages using the Belady Optimal algorithm and an allocation of 3 frames. How many page faults are there?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the following page reference string:2 4 2 8 5 4 3 7 5 2 8 4 6 8 3Assume that FOUR (4) frames are initially empty in the memory. Perform the page faults trace analysis to determine the number of page faults that will occur for each of the following page replacement algorithms. (i) First-In-First-Out (FIFO), Least-Recently-Used (LRU) and Optimal Page Replacement
Given that main memory is composed of two page frames for public use and that aseven-page program (with pages A,B, C, D) requests pages in the following order:A, B, A, C, A, B, D, B, A, C, Da. Using the FIFO page removal algorithm, do a page trace analysis indicating pagefaults with asterisks (*). Then compute the failure rate. b. Using the LRU page removal algorithm, do a page trace analysis indicating pagefaults with asterisks (*). Then compute the failure rate.
An operating system uses a Least Recently Used, optimal and also FIFO page replacement algorithm. Consider the following page reference ordering (pages are referenced from left to right): 1, 9, 1, 6, 9, 2, 6, 2, 1, 9, 0. Compute the hit ratio, miss ratio and number of page faults that are generated for all the three algorithms assuming that the process has been allocated four page frames, and that initially, none of the pages are in the main memory.
Consider a process that references its six pages in the order 6,1,2,3,1,2,4,5,1,3. How many page faults will occur if the process has been allocated just three frames in real memory, all the frames are initially empty, and the page-replacement algorithm is i. FIFO. ii. Optimal. iii. LRU (least recently used).
A process refers to 5 pages, 1, 2, 3, 4, 5 in the order : 4,1,0,4,2,1,3,4,2,5,2,1,0,4,3,5,2,0,1,4. If the page replacement algorithm is Optimal, the number of page fault with an empty internal store of 3 frames is?
Consider the following page reference string: 4, 2, 3, 1, 2, 6, 3, 4, 6, 7, 7, 1, 0, 5, 4, 1, 2, 5, 4, 4 Using the Optimal page replacement algorithms with 3 frames, show the page load order and number of page faults that would occur.
A hypothetical computer machine works with a 3-page frame for storage of process pages in the main memory. Assume that all the page frames are initially empty. Compute the total number of page faults and page hits that will occur while processing the page reference string using the optimal page replacement and LRU replacement algorithm.State which algorithm will provide a better result for the below mentioned string: 1 3 2 0 0 4 4 6 7 9 4 7 3 9 8 4 2 1 2 14 7 5 9 20 4 7 9 0 2
Consider a system with four page frames and a program that uses eight pages. Consider the reference string 0 1 7 2 0 3 1 7 0 1 7 and assume that all four page frames are initially empty. Consider the three following algorithms: a. Optimal page replacement b. FIFO page replacement c. LRU page replacement In each cases show a diagram (ASCII art recommended) that shows which pages are in which frames throughout time, and page faults at the bottom. For instance: would mean that at step 1 page 0 is referenced and loaded into frame 0, which is a page fault; then page 1 is referenced, and so on. The goal is to fill this table to see what in memory when and thus infer the number of page faults. The first 4 steps are ALWAYS the same, as above (i.e., just fill the four frames, with one page fault each time)
Consider a 1GByte memory that can be managed by either a bitmap or a linked list. The memory allocation unit is in units of n bytes, which is some power of 2. Memory in the linked list is either marked as free or used (i.e. holes and segments). Assume that each node in the list requires 64 total bits (including a memory address, a length, and a pointer to the next linked list element). Also, make the (unrealistic) assumption that holes and segments are all 32KB (215 bytes) and that they alternate so that there is no coalescing of adjacent holes. It also means that each linked list element covers either a 32KB hole or a 32KB segment. Determine how much memory each data structure uses (the bitmap will be in terms of n)
According to the inclusion property of a stack page replacement technique, the group of pages in memory corresponding to n frames is always a subset of the group of pages in memory corresponding to n frames plus one for the same sequence of accesses. Show that OPT and LRU have been proven (recently).
1. Consider pge reference string 1,3,0,3,5,6 with 3 page frames. Find number of page faults in following algorithm 1) Least Recently Used 2) Optimal Replacement
Consider a system with four page frames and a program that uses eight pages. Consider the reference string 0 1 7 2 0 3 1 7 0 1 7 and assume that all four page frames are initially empty. Consider the three following algorithms: a. Optimal page replacement In each cases show a diagram (ASCII art recommended) that shows which pages are in which frames throughout time, and page faults at the bottom. For instance: The first 4 steps is ALWAYS the same (i.e., just fill the four frames, with one page fault each time)