Imagine that to save space, the TLB drops the Read/Write and User/Supervisor protection bits. The page table still has the protection bits. However, when moving from user mode to kernel mode (or vice versa), the TLB is flushed. i) Could a process access memory belonging to another process? How? ii) Could a process access memory belonging to the kernel? How? iii) What problem could arise if a process can write memory it is normally supposed to only read?

Imagine that to save space, the TLB drops the Read/Write and User/Supervisor protection bits. The page table still has the protection bits. However, when moving from user mode to kernel mode (or vice versa), the TLB is flushed. i) Could a process access memory belonging to another process? How? ii) Could a process access memory belonging to the kernel? How? iii) What problem could arise if a process can write memory it is normally supposed to only read?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 11P

See similar textbooks

Similar questions

A process contains 8 virtual pages on the disk, and is assigned a fixed allocation of 4 page frames in the main memory . The following page trace occurs: 1, 0, 2, 2, 1, 7, 6, 7, 0, 1, 2, 0, 3, 0, 4, 5, 1, 5, 2, 4, 5, 6, 7, 6, 7, 2, 4, 2, 7, 3, 3, 2, 3 1.Show the successive pages residing in the four frames using the LRU replacement policy. Compute the hit ratio in main memory. Assume that the frames are initially empty. 2.Repeat part (a) for the FIFO replacement policy. 3Compare the two hit ratios and comment on the effectiveness of using FIFO to approximate LRU with respect to this particular trace.
We use the concept "paging" to map logical address to physical address. If the process size is 9216 bytes, the page size is 2048 bytes, how many frames should be allocated to this process? Do we have fragment? If so, please indicate the size of fragment?
A given process has a page table as shown below. Assume that the page size is 2048 and that all the pages are in main memory. What do the numbers 3, 2, 6, 7, and 11 represent? Be specific. To which logical address will the physical address 7356 correspond? To which physical address will the logical address (3,420) correspond? On the average, what will be the internal fragmentation associated with a process for the paging system? Page Table Page 0 3 Page 1 2 Page 2 6 Page 3 7 Page 4 11
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?
What is Translation Look-Aside Buffer used in paging? answer a)It is a memory that is searched when a page is not found in page table b)It is part of the physical memory to hold process control blocks c)It is a bank of special registers inside the processor d)It is an associative memory that can do parallel frame search in hardware
What happens when a translation look-aside buffer (TLB) does not support address-space identifiers (ASIDs)? A. The TLB must be flushed every time a new page table is selected. B. The TLB can contain entries for several processes simultaneously. C. The TLB will have address-space protection for each process. D. The TLB will have unique identifier for each process.
6. Given that pages of a process are accessed in the order of 3(w), 6(w), 1(w), 3(r), 4(r), 6(r), 2(w), 5(r), 3(r), 2(r) and there are 3 page frames allocated to the process. What is the MR if FIFO is applied? What is the MR if LRU is applied? What is the status of the circular linked list after all the references are done if Enhanced Clock is applied? Green background indicates the current head.
Assume a 32-bit virtual address and 4 MBs of memory (i.e., DRAM). If the page size is 1 KB, then what is the size of the page table (ignoring any permission or other overhead bits)?
Suppose that a machine has 42-bit virtual addresses and 32-bit physical addresses.{a} How much RAM can the machine support (each byte of RAM must be addressable)?{b} What is the largest virtual address space that can be supported for a process?{c} If pages are 2 KB, how many entries must be in a single-level page table?{d} If pages are 2 KB and we have a two-level page table where the first level is indexed by 15-bits, then how many entries does the first-level page table have?{e} With the same setup as part {d}, how many entries are in each second-level page table?{f} What is the advantage of using a two-level page table over single-level page table?
For an old computing system with 2K bytes physical memory, and the virtual address has 13bits. Suppose that the size of page/frame is 256 bytes. For a process A, it has its codes and data inpage 0, 1, 2, 10, 11, 28, 29, where pages 0, 1, 10, 29 are in frame 1, 3, 4 and 6, respectively.Moreover, frame 0 contains kernel OS code/data and all other frames are free.a. Show the page table and the content of each PTE for process A;b. Use a figure to illustrate the address translation for virtual address 1110000100000 and explainwhat happens during the translation (interaction among page table, physical memory, disk, andoperating system);c. Suppose that there is a TLB with 4 entries and the current content has the mapping informationfor pages 0, 1. Draw a new figure to illustrate the translation of address 101000011000 andexplain what happens during the translation process.
What are structural hazards? Why do they never occur in a single-cycle implementation? what is a page table size for a virtual memory with a 64-bit virtual address, 32kB page size and 8 bytes per entry? Give an example of when your program will experience low spatial locality (what data structure?), and an example of when your program will experience low temporal locality.
It is given that on a system, on average, an instruction executes in 1 nano second. Suppose that it takes 20 micro seconds of processor time for page fault. While, it takes 300 micro seconds of disk time for reading and writing a single page. Suppose that on average 1/3 of the pages that need to be paged out are modified. What is the average number of instructions between page faults that would cause the disk to be busy doing page transfers all the time?