The following table shows the core map (having more information than page table) 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 # Counter 1 Frame # 1 1 0 1 2 1 4 2 2 2 3 3 1 3 1 3 4 5 2 11 5 2 0 6 6 3 2 7 Which virtual address of which process maps to physical address 2500? a. doesn't map O b. process 2, virtual address 2500 O c. process 2, virtual address 1500 d. process 1, virtual address 1500 O e. process 1, virtual address 2500 Clear my choice

The following table shows the core map (having more information than page table) 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 # Counter 1 Frame # 1 1 0 1 2 1 4 2 2 2 3 3 1 3 1 3 4 5 2 11 5 2 0 6 6 3 2 7 Which virtual address of which process maps to physical address 2500? a. doesn't map O b. process 2, virtual address 2500 O c. process 2, virtual address 1500 d. process 1, virtual address 1500 O e. process 1, virtual address 2500 Clear my choice

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.
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…
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.
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.
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?
Assume a hypothetical system where disk space has been divided into disk blocks of 25 bytes. The operating system needs to allocate space for a 120-byte file called output_log. Create a diagram for each of the three allocation methods showing how the space might be allocated and what information would be stored in the file directory for that file. For Linked Allocation, assume the first 5 bytes of each block is used for the pointer
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
. Compare the memory organization schemes of contiguous memory allocation and paging with respect to the following issues:a. External fragmentationb. Internal fragmentationc. Ability to share code across processes
How does dynamic memory allocation function in terms of memory allocation?Describe the different types of dynamic memory allocation/allocators and how they work.
When it comes to allocating data, how does dynamic memory allocation function specifically?How many different types of dynamic memory allocation and allocators exist, and can they be described?
What exactly is meant by the term "dynamic memory allocation," and how does one go about implementing it? What are the benefits, from the perspective of the user, of using this functionality? If there is more than one kind of dynamic memory allocation or allocator, please identify and describe each of the available options.
Given the following information:Free Space ListPartition Size (KB) Queuing Processes Process Size (KB)A 500 P1 170B 350 P2 420C 150 P3 280D 400 P4 90E 350 P5 220F 200 P6 200 List of partitions and processes Show how these SIX (6) processes are allocated into memory partitions when the following allocation algorithms are applied. Give your answer using the following table format. Partition Partition Size Process Process size Internal Fragmentation…