Q4. Consider the following page reference string of a process. Assume the process has 3 frames. Second chance (assume reference bits are cleared after every 6 references). Show the memory state (the pages in memory and their reference bits values) after each page reference. Also indicate which reference causes a page fault. 3543562523425427473

Q4. Consider the following page reference string of a process. Assume the process has 3 frames. Second chance (assume reference bits are cleared after every 6 references). Show the memory state (the pages in memory and their reference bits values) after each page reference. Also indicate which reference causes a page fault. 3543562523425427473

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

A process references five pages A, B, C, D and E in the following order, A, C, B, E, A, B, E, A, B, C, D, E. Assume the replacement algorithm is first-in-first-out. Find the number of page transfers during this sequence of references starting with an empty main memory with three page frames. Repeat for four page frames.
In a main memory-disk virtual storage system, the page size is 1KByte and the OPTIMAL algorithm is used for page replacements. A given program has been allocated three page frames in the main memory and it makes the following 16 memory references when it starts executing (the addresses are given in decimal):500, 2000, 2500, 800, 4000, 1000, 5500, 1500, 2800, 400, 5000, 700, 2100, 3500, 900, 2400 Fill in the contents of the three page frames after each memory reference in a table and calculate the hit ratio. Hint: denote by 'a' the page consisting of locations 0 through 1023 in memory. Similarly, b: 1024-2047, c: 2048-3071, d: 3072-4095, e: 4096-5119 and f: 5120-6143. Round to three decimal places.
A machine has a memory of 64 frames, with each frame being 1K bytes. Current free-frame list is: O×2E, Ox27, Ox37, Ox25, OX0C, Ox04, OXOE, Ox09, O×1D, Ox14, Ox16, Ox07, 0x22, 0×3E, and Ox30. You just scheduled a process that requires 10 frames. Show the resulting page table. Show the translation of logical address Ox240B and OX5A32 into physical addresses using your page table. Express your result in hex.
Please write the final answer in the following answer table. question 1 question 2 question 3 question 4 Given that pages of a process are referenced by the CPU in the order of 2(r), 4(w), 3(w), 1(w), 5(r), 6(w), 1(r), 4(r), 7(r) and there are 4-page frames allocated to the process initially, what is the status of the pages and page frames after all the references are done if each of the following algorithms is applied? 1. clock. 2. enhanced clock. 3. NRU version-1 4. NRU version-2
Consider a computer with 128 MB of main memory, 64 KB of cache, and 4 bytes per memory block. Find out how to split the address (s-r, r, w) so that it can be used for direct mapping.Find out how to split the address into two parts (s and w) for associative mapping.Find out how to split the address into three parts (s-d, d, and w) for set associative mapping. Assume that each cache set has two lines.
In the working set model, the idea is to examine the most recent delta page referances. It is also known as an approximation of the Program's Locality. If the total demand is greater than the total number of available frames (D>m) then it will cause thrashing, because in this case, some processes will not have enough frames. Below you see 3 processes and their excepted memory references during their execution. When will the thrashing happen to occur according to the working set model? Assume total memory(m) is 10 and Delta is 5
A system with simple paged memory management has addresses of B bits and pages of size P KiB. If all memory is pageable, what is the maximum number of items contained in a process's page table? What if K KiB are reserved for the kernel and are not pageable? Also suppose that the page table is organized in 2 levels, so that the page directory (first level) is addressed by D bits. How many bits will be used to address the second level? How many entries will there be, at most, among all the tables of the pages (first and second level) of a process?
Transcribed Image Text OCCURS WHEN MULTIPLE PROCESSES OR THREADS READ AND WRITE DATA ITEMS SO THAT THE FINAL RESULT DEPENDS ON THE ORDER OF EXECUTION OF INSTRUCTIONS IN THE MULTIPLE PROCESSES. Select one: a.COMPETING PROCESSES b.CRITICAL SECTION c.MUTUAL EXCLUSION d.RACE CONDITION
Plot the output in an Excel graph. Explain your findings. Adjust your inputs to get meaningful outputs. //Write a program that simulates a paging system using the aging algorithm. The number of page//frames is a parameter. The sequence of page references should be read from a file.//For a given input file, plot the number of page faults per 1000 memory references as a function of//the number of page frames available. #include <stdio.h>#include <stdlib.h>#include <stdbool.h> //THE PAGE FREQUENCY PER 1000 MEMORY REFERENCE DATA IS STORED IN A SEPARATE FILE CALLED DATA.TXT.//DATA POINTS CAN BE USED TO PLOT THE GRAPH void AgeIncrease (int frames);int OldestIndex (int frames); struct PageTable {int frame_number;bool valid;}*PageTable; struct FrameTable {int page_number;int age;}*FrameTable; int main (void){printf("Number of pages:\n");int pages;scanf("%d", &pages);printf("Number of frames:\n");int frames;scanf("%d",…
CODE IN JAVA !!!!!!!!!!!!!!!!!!!!!!! Provide a code for LRU The Last Recently Used (LRU) solution for the memory page replacement but using two bits (boolean variable in Java) for the clock algorithm with one indicates the reference bit and the other indicates the read/write bit. Here we assume for all the processes, the pages with the number 2 and 5 involve data writing operation; all the other numbers (1, 3, 4, 6) only involve reading operations. Provide output examples of the code at the bottom.
Suppose we have a computer system with 44-bit logical addresses, page size of 64KiB, and 4 bytes per page table entry. b. Suppose we use two-level paging and arrange for all page tables to fit into a single page frame. How will the bits of the address be divided up? (show your work) c. Suppose we have a program with a 4GiB address space. Counting the program and all page tables, using the two-level page table scheme from the previous question, how much memory, in number of page frames, is used? (show your work)
Consider a system that would implement the page table on the CPU if feasible. (a) Give an advantage of this strategy. (b) Give a disadvantage of this strategy.