Given a scenario where there are four frames. The following table shows the loading time of a page into each page frame, the time of last access to the page, and the Referenced (R) and Modified (M) bits for each page frame (the times are in clock ticks from the process start at time 0). Table 1: Virtual Page Information Virtual Page Time Time R M Loaded Referenced bit Number bit 3 136 245 1 1 1 98 214 1 125 240 2 76 255 1 1 a. A page fault to virtual page 4 has occurred at time 256. Which page should be replaced for each of the following memory management policies? i FIFO ii. LRU b. Consider the following virtual page reference string, that includes the initial placement of virtual page in memory (as in Table 1) just before the page fault: 1, 0, 3, 2, 4, 5, 0, 1, 3, 4, 2, 5, 4, 1 How many page faults would occur if Optimal policy were used? Show clearly when each page fault would occur.

Given a scenario where there are four frames. The following table shows the loading time of a page into each page frame, the time of last access to the page, and the Referenced (R) and Modified (M) bits for each page frame (the times are in clock ticks from the process start at time 0). Table 1: Virtual Page Information Virtual Page Time Time R M Loaded Referenced bit Number bit 3 136 245 1 1 1 98 214 1 125 240 2 76 255 1 1 a. A page fault to virtual page 4 has occurred at time 256. Which page should be replaced for each of the following memory management policies? i FIFO ii. LRU b. Consider the following virtual page reference string, that includes the initial placement of virtual page in memory (as in Table 1) just before the page fault: 1, 0, 3, 2, 4, 5, 0, 1, 3, 4, 2, 5, 4, 1 How many page faults would occur if Optimal policy were used? Show clearly when each page fault would occur.

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

Related questions

Q: computer system with three users: Alice, Bob, and Cindy. Alice owns file X, and Bob and Cindy can…

A: The question is asking to:Create an Access Control Matrix (ACM) for a computer system with three…

Q: segment sizes and starting resses. Segment Table Size Address 2048 2000 6. 1024 400 7 2048 6000 8000…

A: 1) LA(5, 2000) Here offset<size, So physical address = offset + base address = 2000+2000=4000…

Q: We study the simulator vsfy.py and generate the following instance. Please select the correct…

A: The given instance represents the state of a file system simulator before and after a sequence of…

Q: this problem we want to modify the single cycle datapath shown below (also in in slide 1 of…

A: Jump instruction resemble the branch but it computes the PC in different way and it is…

Q: tes are stored in memory locations from 8050h to 805Fh. Write 8085 ALP to transfer the the locations…

Q: Student information is being held in a data area, where each student record has the following…

A: Introduction: The GetMax subroutine should commence by loading the first record's address ($10000)…

Q: Suppose your system has a memory of size 100 MB using contiguous memory allocations and there are 4…

A: we are using ASCII code for size of process we are taking s = 115 u = 117 f = 102 y = 121 a = 97…

Q: In the space below list the sequence of processes in the execution order that are on the critical…

A: Single Cycle Datapath which refers to the equivalent to the original single cycle datapath. The data…

Q: A system uses proportional allocation (according to process size) when allocating frames to…

A: Proportional allocation: Frames are allocated to each process according to the process size. For a…

Q: Describe the detains of the encoding process when the next two inputs bits are both 1;

A: The question has been answered in step2

Q: Consider a system with N bytes of physical RAM, and M bytes of virtual address and frames are K…

A: Here the virtual memory size = M bytes And page size is K bytes. The virtual address is divided…

Q: Implementing AES Implement (almost) the first round of AES with a 128-bit key. Given a 128-bit…

A: Steps for the AES Encryption Process The encryption process uses a set of specially designed keys…

Q: In computing, time scales usually store the current time as the number of seconds that have elapsed…

A: Given Data, For the year 2020, Number of seconds passed = 3665044 we know, number of seconds per day…

Q: Maximum path sum II Problem 67 By starting at the top of the triangle below and moving to adjacent…

A: Given, Find the maximum total from top to bottom in triangle.txt text file containing a triangle…

Q: Consider a program that accesses a single I/O device and compare unbuffered I/O to the use of a…

Q: A machine has a memory of 64 frames, with each frame being 1K bytes. Current free-frame list is:…

Question

Given a scenario where there are four frames. The following table shows the loading time
of a page into each page frame, the time of last access to the page, and the Referenced (R)
and Modified (M) bits for each page frame (the times are in clock ticks from the process
start at time 0).
Table 1: Virtual Page Information
Virtual Page
Time
Time
R
M
Loaded
Referenced
bit
Number
bit
136
245
1.
1
1
98
214
1
125
240
1
2
76
255
1.
1
a. A page fault to virtual page 4 has occurred at time 256. Which page should be replaced
for each of the following memory management policies?
į FIFO ii.
LRU
b. Consider the following virtual page reference string, that includes the initial placement
of virtual page in memory (as in Table 1) just before the page fault:
1,0, 3, 2, 4, 5, 0, 1, 3, 4, 2, 5, 4, 1
How many page faults would occur if Optimal policy were used? Show clearly when
each page fault would occur.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Calculate the total page faults using the CLOCK algorithm and a window size = 3 frames Given the following reference string : 1 2 1 3 45 3245 6 4 3 2 Fill in chart. Include the use bit (required for last set of frames only) There is no internal fragmentation. Total page faults CLOCK algorithm The process running has at least The size of a frame is 256 bytes. The program has at least pages in the program. bytes 3 4 5265
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. How many bits are used for the page number? How many bits are used for the offset? 8 bits each. With this system, what’s the maximum number of pages that a process can have? 256 Suppose that each entry in the page table comprises 4 bytes (including the frame number, the valid bit, and miscellaneous “bookkeeping bits”). An OS uses an array to store the page table. What is the size of the page table? 1024 Bytes Furthermore, suppose the first 6 pages of a process map to frames 222 to 227 (as decimal numbers), and the last 5 pages of the process map to frames 1 to 5 (also decimal numbers). All other pages are invalid. Draw the page table, including the valid bit and the frame number. DONE Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert…
Load infile using one byte per channel and save it as a PNG, using outfile for the file name. Use one byte per channel. graphics.cpp 1 #define STB IMAGE IMPLEMENTATION 2 #define STB IMAGE WRITE IMPLEMENTATION #include "stb_image.h" #include "stb_image_write.h" 3 4 #include #include 7 using namespace std; 8 9. int main() 10 { string infile = "pete.png"; string outfile = "out.png"; 11 12 13 14 15 16 17 } CodeCheck Reset
A SONET STS-1 SPE is mapped into an STS-1 line. An STS-1 SPE frame consists of 87 columns of 9 bytes, or altogether 783 bytes. There are always 8,000 frames per second. The SPE clock is slower than the line clock by a factor of 5 x 10-7 .On average, we expect to find one pointer adjustment for how many SONET frames?
A processor uses a serial link to communicate with a keyboard for word processing. A typist using this keyboard can type at rates peaking at 120 words per minute, where a word is 6 characters (including spaces and punctuation). The characters will be transmitted from the keyboard in 8-bit ASCII with one stop bit and no parity. Only consider these and no special characters. The programmer writes setup and polling service routines based on a minimum baud rate, but then finds that the keyboard will only interface at 19.2 Kbaud. Will the polling service routine have to change? Why or why not? Baud Rates 300 600 1200 2400 4800 9600 19200
Q.2 Suppose a system has a logical address space of size 25 (m=5), a page size of 4 bytes, and a physical memory of 128 bytes. Given the following page table, find out the respective physical addresses for each of the logical address listed in Table 2. (Note: all addresses are expressed in decimal number system) Table 1: Page table 0 2 5 7 0 15 1 2 3 4 5 18 6 20 7 22 Table 2: Fill out this table with corresponding physical memory addresses Logical Address Physical Address 0 6 10 17 23
Consider a paged virtual memory system in which a process is allocated with 4 frames. The contents of the page map table are given below with two frames being empty. PageActual frame address in memory 4 122 344 477 898 Assume that the order in which the pages appear is the order in which the pages were added to the table (i.e., Page 2 was accessed after Page 4) Assume that the subsequent page accessing is : 1,2,3,4,1,2,5 Using LRU page-replacement algorithm, What frame is accessed by Page 5. 477 O 344 122 O 898