The following table shows the core map of a virtual memory system at time t, which has a page size of 1000 bytes. In this table, column "Counter" indicates the number of references on the corresponding page till time t [small value indicates the least recently accessed page]. Process ID Page # Frame # Counter 1 1 lo 1 1 2 4 2 3 3 1 3 2 3 4 lo 2 6 6 3 7 17 Let's assume the given system has memory of 8000 bytes. Right now (@time t), process 1 issues a reference to its logical address 4500, there will be a page fault. If the system deploys LRU algorithm for page replacement with local replacement policy, what is the corresponding physical address being referenced? O a. 5500 O b. 500 O c. 2500 O d. 1500 O e. 4500

The following table shows the core map of a virtual memory system at time t, which has a page size of 1000 bytes. In this table, column "Counter" indicates the number of references on the corresponding page till time t [small value indicates the least recently accessed page]. Process ID Page # Frame # Counter 1 1 lo 1 1 2 4 2 3 3 1 3 2 3 4 lo 2 6 6 3 7 17 Let's assume the given system has memory of 8000 bytes. Right now (@time t), process 1 issues a reference to its logical address 4500, there will be a page fault. If the system deploys LRU algorithm for page replacement with local replacement policy, what is the corresponding physical address being referenced? O a. 5500 O b. 500 O c. 2500 O d. 1500 O e. 4500

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 21VE

See similar textbooks

Similar questions

In the below figure look at Show the memoryallocation of process requests of size 90KB, 39KB, 27KB, 16KB and 36KB which will bereceived in order using:a) Best-Fit memory allocation methodb) Worst-Fit memory allocation method.
Memory sequence comes in:i. Allocation of P1 9MB,ii. Allocation of P2 9MB,iii. Allocation of P3 9MB,iv. 3MB P4 allocationv. Release P4 3MB Allocationvi. Remove P1 Create a dynamic memory partitioning algorithm, then circle where the P3 is locatedUsing the following algorithm: i. Worst-Fit ii. Best-Fit iii. First-Fit
17. a) Consider an application running on a multiprocessor system that takes 600 cycles,(during which processors are stalled), to handle a local cache miss leading to referencing a remote memory. The CPI for all references that hit in cache is 1 cycle. If 0.2% of cache access result in a local miss, how much faster will the system run if it has a perfect cache that never miss.
As described in COD Section 5.7 (Virtual memory), virtual memory uses a page table to track the mapping of virtual addresses to physical addresses. This exercise shows how this table must be updated as addresses are accessed. The following data constitute a stream of virtual byte addresses as seen on a system. Assume 4 KiB pages, a four-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number. TLB Page Table (a) For each access shown above, list whether the access is a hit or miss in the TLB, whether the access is a hit or miss in the page table, whether the access is a page fault, the updated state of the TLB. (b) Repeat Part a, but this time use 16 KiB pages instead of 4 KiB pages. What would be some of the advantages of having a larger page size? What are some of the disadvantages? (c) Repeat Part a, but this time use 4 KiB pages and a two-way set associative TLB. (d) Repeat Part a, but…
Problem Solving: Assume the following processes are waiting to be loaded in main memory. Process Size A 5 MB B 7 MB C 8 MB D 10 MB E 15 MB Which of the following processes are going to be served by the main memory with 45 MB total space in a fixed partition divided into 5 slots? Currently the first slot is occupied by the operating system. Illustrate the memory allocation. What is the total free space? What is the total internal fragmentation? Still using the given process, a computer system has a 64 MB main memory which is divided into 7 fixed unequal partitions such as 10MB, 20MB, 5MB, 5MB, 8MB, 10MB, and 6MB, respectively. First partition is for OS. Illustrate the memory allocation. What is the total free space? Is there external…
Suppose we have a system with 50 active processes, P0, P1, ..., P49, some user processes, and some kernel processes. For simplicity, we are not concerned with threads in this question. Ready processes are scheduled to Run by some scheduler. The scheduling algorithm does not matter here. Suppose process P13 makes a disk_read() operating system call. Assume that completion of disk transfer is signaled by an interrupt from the disk controller. Trace as accurately as you can what happens in the CPU (not the disk) until process P13 has received its requested information from the disk. Hints: The question is about interrupt handlingI am looking for a trace of what processes run, why, and what they do.I am not looking for instruction-level explanations.I am not looking for a discussion of disk access, operation, or transfer.
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.
How does dynamic memory allocation work? What is it, why is it essential, and how does it benefit the user? When more than one kind of dynamic memory allocation/allocator exists, identify and describe each type of dynamic memory allocation/allocator.
Suppose your system has a memory of size 100 MB using contiguous memory allocations and there are 4 fixed size partitions. Partition one of size 50, partition 2 of size 200, partition 3 of size 100 and partition 4 of size 150 Consider First 5 letters of your name. The ASCII code of the letters is the size of process and the alphabet is the name of process. The processes appear in alphabetical order. Q= How many processes will be loaded in the memory at a time? For contiguous memory allocation show the algorithms used to allocate memory partitions to each process and state which algorithm will work best and why? Also state the amount of internal and external fragmentation for the processes and partitions after allocation NOTE :MY NAME IS ALIZAHID
In this exercise, we will examine space/time optimizations for page tables. The following list provides parameters of a virtual memory system. Virtual Address (bits) Physical DRAMInstalled Page Size PTE Size (byte) 43 16 GiB 4 KiB 4 For a single-level page table, how many page table entries (PTEs) are needed? How much physical memory is needed for storing the page table? Using a multilevel page table can reduce the physical memory consumption of page tables, by only keeping active PTEs in physical memory. How many levels of page tables will be needed in this case? And how many memory references are needed for address translation if missing in TLB? An inverted page table can be used to further optimize space and time. How many PTEs are needed to store the page table? Assuming a hash table implementation, what are the common case and worst case numbers of memory references needed for servicing a TLB miss?
Suppose we have a system with 50 active processes, P0, P1, ..., P49, some user processes, and some kernel processes. For simplicity, we are not concerned with threads in this question. Ready processes are scheduled to Run by some scheduler. The scheduling algorithm does not matter here. Suppose process P13 makes a disk_read() operating system call. Assume that the completion of disk transfer is signalled by an interrupt from the disk controller. Trace as accurately as you can what happens in the CPU (not the disk) until process P13 has received its requested information from the disk. Hints: The question is about interrupt handling I am looking for a trace of what processes run, why, and what they do. I am not looking for instruction-level explanations. I am not looking for a discussion of disk access, operation, or transfer.