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

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter7: Transportation, Assignment, And Transshipment Problems

Section: Chapter Questions

Problem 5RP

See similar textbooks

Similar questions

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 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.
A buddy system allocates memory from a fixed-size segment consisting of physically contiguous pages using a power-of-2 allocator. Consider a computer system that has 256M memory available. By using diagram, show the results of each memory request/release via memory layout at each stage according to the followings orders: requests 25M requests 110M requests 52M Release A Release C requests 75M Page Time Loaded Last Reference R bit M bit 2 117 212 1 1 0 130 264 0 0 3 58 240 1 0 1 86 203 1 1 In your own words, explain what happened to the memory block prior to the last request allocation. Calculate the total of internal fragmentation (in M unit) after memory allocation to request C is fulfilled.
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority Arrival Time P1 20 2 0 P2 10 1 1 P3 80 4 2 P4 40 2 3 P5 50 3 4 Draw the GANTT Chart for the schedule of the processes, the waiting time for each process, the average waiting time, the turnaround time for each process and average turnaround time using the following scheduling algorithm.…
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority Arrival Time P1 20 2 0 P2 10 1 1 P3 80 4 2 P4 40 2 3 P5 50 3 4 Draw the GANTT Chart for the schedule of the processes, the waiting time for each process, the average waiting time, the turnaround time for each process and average turnaround time using the following scheduling algorithm. c.…
Consider the following set of six processes, with the arrival times, CPU burst time (in milliseconds), and priority. process arrival time burst time priority P1 22 10 3 P2 8 4 2 P3 28 12 6 P4 10 8 1 P5 35 6 5 P6 8 20 4 (a) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, preemptive priority (a smaller priority number implies a higher priority), and RR (quantum= 8).(b) Compute the average wait time in each of the scheduling algorithms in part (a)?
Consider the following set of processes, with the length of the CPU burst given in milliseconds. Process Burst Time Priority P1 2 2 P2 1 1 P3 8 4 The processes are assumed to have arrived in the order of P1, P2, P3, P4, P5 all at time 0. a. Draw the Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: preemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). b. What is the turnaround time of each process for each of the scheduling algorithms in part i? c. Which of the algorithms results in the minimum average waiting time (over all processes)?
Consider the following set of processes, the length of the CPU burst time given in milliseconds: Process Burst Time P1 6 P2 8 P2 7 P4 3 Assuming the above processes are being scheduled with the Shortest Job First (SJF) scheduling algorithm. The waiting time for process P1 is 3ms The waiting time for process P1 is 0ms The waiting time for process P1 is 16ms The waiting time for process P1 is 9ms From the following list which is the deadlock avoidance algorithm? Banker’s algorithm Round-robin algorithm Elevator algorithm Karn’s algorithm A problem encountered in multitasking when a process is perpetually denied necessary resources is called Deadlock Starvation Inversion Aging To break a deadlock: Abort one or more processes to break the circular wait Abort all the process in the system Preempt all resources from all processes None of the mentioned Termination of the process terminates First thread of the process First two threads…
Suppose that we want to schedule disk requests on a disk containing 200 cylinders numbered from 0 to 199. The Disk requests to be addressed are 82,170,43,140,24,16,189. And the Read/Write arm is at 48, and it is also given that the disk arm should move "towards the larger value". Q₁- Illustrate on a graph the total read/write head movement for the SCAN Disk scheduling algorithm. Q2- Calculate the total overhead movement (total distance covered by the disk arm).
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority Arrival Time P1 20 2 0 P2 10 1 1 P3 80 4 2 P4 40 2 3 P5 50 3 4 Draw the GANTT Chart for the schedule of the processes, the waiting time for each process, the average waiting time, the turnaround time for each process and average turnaround time using the following scheduling algorithm. b.…
Consider the following set of processes, with the length of the CPU burst given in milliseconds Process Burst Time Priority P1 5 1 P2 2 3 P3 1 3 P4 1 2 P5 10 4 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, and RR (quantum = 3). What is the turnaround time of each process for each of the scheduling algorithms in part a? what is the waiting time of each process for each of the scheduling algorithms in part a? Which of the algorithms results in the minimum average waiting time (over all processes)?
Consider the following set of processes, with the length of the CPU burst given in seconds: Process Burst time Arrival time P1 10 1 P2 04 2 P3 05 3 P4 03 4 Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF preemptive and Round Robin (quantum = 3). What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these scheduling algorithms? Which of the algorithms results in the minimum average waiting time (over all processes)? Which of the algorithms results in the minimum average turnaround time (over all processes)?
1. Consider the following set of processes, with the length of the CPU burst given inmilliseconds: Process Burst Time PriorityP1 2 2P2 1 1P3 8 4P4 4 2P5 5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.a. Draw four Gantt charts that illustrate the execution of these processes using thefollowing scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger prioritynumber implies a higher priority), and RR (quantum = 2).b. What is the turnaround time of each process for each of the scheduling algorithms inpart a?c. What is the waiting time of each process for each of these scheduling algorithms?d. Which of the algorithms results in the minimum average waiting time (over allprocesses)?