Assume in a Virtual Memory system, a program needs 10 pages with page numbers 0 to 9 and each page is 4 words and the program is allocated 3 page frames: a, b, and c. The word trace for 26 memory accesses by the program are listed below. Use a table similar to the one shown on Slide 7 of Lesson 20 to compare the three replacement policies: LRU, OPTimal, and FIFO, by calculating and comparing the hit rate of each policy for these 26 memory accesses. Word trace: 0, 1, 2, 3, 8, 16, 17, 4, 5, 6, 7, 9, 10, 11, 12, 8, 9, 10, 28, 29, 30, 4, 5, 12, 4, 5

Assume in a Virtual Memory system, a program needs 10 pages with page numbers 0 to 9 and each page is 4 words and the program is allocated 3 page frames: a, b, and c. The word trace for 26 memory accesses by the program are listed below. Use a table similar to the one shown on Slide 7 of Lesson 20 to compare the three replacement policies: LRU, OPTimal, and FIFO, by calculating and comparing the hit rate of each policy for these 26 memory accesses. Word trace: 0, 1, 2, 3, 8, 16, 17, 4, 5, 6, 7, 9, 10, 11, 12, 8, 9, 10, 28, 29, 30, 4, 5, 12, 4, 5

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...

See similar textbooks

Similar questions

An operating system uses the banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution Allocation Max X Y Z X Y Z P0 0 0 1 8 4 3 P1 3 2 0 6 2 0 P2 2 1 1 3 3 3 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Write a program to check whether: Only REQ1 can be permitted Only REQ2 can be permitted…
An operating system uses the banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0O, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution Allocation Max Y X Y PO 8 4 3 P1 3 6 P2 2 1 1 3 3 3 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: PO requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Write a program to check whether: A. Only REQ1 can be permitted B. Only REQ2 can be permitted C. Both REQ1 and REQ2 can be permitted D. Neither REQ1 nor REQ2…
An operating system uses the banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution Allocation Маx Y Y PO 8 4 3 P1 3 2 6 2 P2 2 1 3 3 3 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Write a program to check whether: A. Only REQ1 can be permitted B. Only REQ2 can be permitted C. Both REQ1 and REQ2 can be permitted D. Neither REQ1 nor REQ2 can…
Computer A has an overall CPI of 1.3 and can be run at a clock rate of 600MHz. Computer B has a CPI of 2.5 and can be run at a clock rate of 750 MHz. We have a particular program we wish to run. When compiled for computer A, this program has exactly 100,000 instructions. How many instructions would the program need to have when compiled for Computer B, in order for the two computers to have exactly the same execution time for this program? Please explain how to solve
Create a memory allocation program to show the how the First Fit strategy would allocate memory and move the spaces in memory. Given the memory block size is 20 and initially there are 5 holes with the sizes { 4, 3, 8, 2, 3} After each allocation, if there are leftover space, the space can be given to the next hole. If there are 5 blocks of data with sizes {3,4,3,5,3}. Try to fit them in the block of memory. How are the hole sizes changed as you allocate and shuffle the memory *CREATE C PROGRAM AND PLEASE FOLLOW THE SAMPLE OUTPUT GIVEN
Create a memory allocation program to show the how the First Fit strategy would allocate memory and move the spaces in memory. Given the memory block size is 20 and initially there are 5 holes with the sizes { 4, 3, 8, 2, 3} After each allocation, if there are leftover space, the space can be given to the next hole. If there are 5 blocks of data with sizes {3,4,3,5,3}. Try to fit them in the block of memory. How are the hole sizes changed as you allocate and shuffle the memory. Pseudocode: int n[5]={4,3,8,2,3}; int* arr = (int*) calloc(3, sizeof(int)); for (5 holes) { realloc(arr size to current hole size); for(arr size) print arr[]; } int n[5]={4,3,8,2,3}; bool full[5] = {false, false, false, false, false}; // keep track of hole occupied input data block size; for(all holes) { if((found current hole size >= data size) && not occupied ) { if (current hole size > data size && next hole not occupied…
An operating system uses the banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution Allocation Маx X Y X Y PO 1 8 3 P1 3 2 6 2 P2 1 3 3 3 There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: PO requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Write a program to check whether: Only REQ1 can be permitted Only REQ2 can be permitted Both REQ1 and REQ2 can be permitted Neither REQ1 nor REQ2 can be…
Create a memory allocation program to show the how the First Fit strategy would allocate memory and move the spaces in memory. Given the memory block size is 20 and initially there are 5 holes with the sizes { 4, 3, 8, 2, 3} After each allocation, if there are leftover space, the space can be given to the next hole. If there are 5 blocks of data with sizes {3,4,3,5,3}. Try to fit them in the block of memory. How are the hole sizes changed as you allocate and shuffle the memory. Pseudocode: int n[5]={4,3,8,2,3}; int* arr = (int*) calloc(3, sizeof(int)); for (5 holes) { realloc(arr size to current hole size); for(arr size) print arr[]; } int n[5]={4,3,8,2,3}; bool full[5] = {false, false, false, false, false}; // keep track of hole occupied input data block size; for(all holes) { if((found current hole size >= data size) && not occupied ) { if (current hole size > data size && next hole not occupied…
1. Consider a machine running a program with four classes of instructions: A/B/C/D. The program requires 360 seconds, with the number of seconds executing each class as shown in the table below: Instruction Class A B C Time (sec) 100 80 120 60 1.1. By how much is the total execution time changed if the time for class D is reduced by 20% and the time for class C is increased by 10% (assuming no other changes)? 1.2. If we want to reduce the total execution time by 20% by optimizing class A only, what is the target execution time of class A instructions in order to achieve the reduction (assuming all other instructions are not changed)? 1.3. Can the total time be reduced by 25% if we only optimize class B? Use calculation to justify your answer.
Assume that a memory module contains three holes of 10MB each. A sequence of 14 requests for 1MB each will be processed (See the diagram below). For each of the memory allocation methods listed below, draw a diagram representing how memory is allocated and determine the sizes of the remaining holes after all 14 requests have been satisfied. First fit Next fit C. Best fit d. a. b. Worst fit Hint - For the Next fit, the following allocation starts with the hole following the previous allocation 10 Mb 10 Mb 10 Mb
A computer uses virtual memory, and a new solid-state drive (SSD) as space for paging. Refer to the last ppt file. In the case presented there, the hard disk drive (HDD) required 25 ms to read in a page, and a rate of 1 page fault per 1000 references introduced a 250 slowdown. If the SSD offers a time of only 80 µs, what is the slowdown in performance caused by 1 pf per 1000 references (you are not concerned with dirty vs. clean pages). What is the maximum rate of page faults you can accept if you want no more than a 5% slowdown in execution using virtual memory? Know your metric prefixes and symbols for time: s for seconds, ms for milliseconds, µs for microseconds, ns for nanoseconds.
The Tower of Hanoi Problem Tower of Hanoi is a mathematical game consisting of three pegs (P1, P2 and P3) and a stack of disks of different diameters. Disks can slide onto any peg. The game starts with all disks stacked on P1 and ends at the point where all disks stacked on P3. The game player is required to move all disks from P1 to P3 using P2 as a buffer. Three rules must be followed when playing the game (1) Only one disk may be moved at a time. (2) Each move involves taking a disk on the top of a peg and place it on the top of another peg. (3) A disk of a larger diameter should never be placed on top of a disk of a smaller diameter. The diagrams below demonstrate the starting state and goal state of the game with 5 disks. starting sate p1 to goal state p3 Requirements In this assignment, students are required to solve the Tower of Hanoi (with five disks) using state space search algorithms implemented in Python. Two state space search algorithms: (1) a blind search (depth-first…