II. (a) An OS is using two-level paging to implement a 28-bit
virtual address space per
process. The page size is 256-bytes, and the machine does not have
a TLB. Explain the steps
involved in looking up the virtual address 0x03bf04d, when all
pages are present in memory.
(2 points)
(b) For the system above, what is the maximum number of page faults
that could be
generated in response to a memory access? (2 points)
(a)
8 bits needed for offset 256 bytes, 20 bits required for the VPN
Page table has 6 bits
Page directory has 14 bits
To look up the Operating System (OS) it will look the first 14 bits to find the physical address of the page in the table
Now Page Table Entry is found
Now you can find the physical address which then applies to the offset
(b)
Maximum number of page fault is one because the Page Table Entry(PTE) or Page Directory Entry(PDE) has a bit that stops it
--
all the best
II. (a) An OS is using two-level paging to implement a 28-bit virtual address space per...
3. Virtual Memory (20 points) An ISA supports an 8 bit, byte-addressable virtual address space. The corresponding physical memory has only 256 bytes. Each page contains 32 bytes. A simple, one-level translation scheme is used and the page table resides in physical memory. The initial contents of the frames of physical memory are shown below. VALUE address size 8 bit byte addressable each byte of addressing type memory has its own address 32 B page size physical memory size 256...
A certain byte-addressable computer system has 32-bit words, a virtual address space of 4GB, and a physical address space of 1GB. The page size for this system is 4 KB. Assume each entry in the page table is rounded up to 4 bytes. a) Compute the size of the page table in bytes. b) Assume this virtual memory system is implemented with a 4-way set associative TLB (Translation Lookaside Buffer) with a total of 256 address translations. Compute the size...
Virtual memory address translation: a) Consider a machine with a physical memory of 8 GB, a page size of 4 KB, and a page table entry size of 4 bytes. How many levels of page tables would be required to map a 52-bit virtual address space if every page table fits into a single page? b) Without a cache or TLB, how many memory operations are required to read or write a page in physical memory? c) How much physical...
Address Translation Question
[8 points] Suppose a computing system uses paging with a logical
address of 24 bits and a
physical address of 32 bits. The page size is 4KB. Answer each of
the following. If an answer is a power of 2, you can leave it in
the form of a power of 2. ...
2. [20 points] Memory address translation and TLB performance [8 points] Suppose a computing system uses paging with a logical address of 24 bits...
A computer system has a 36-bit virtual address space with a page size of 8K, and 4 bytes per page table entry. How many pages are in the virtual address space? What is the maximum size of addressable physical memory in this system? If the average process size is 8GB, would you use a one-level, two-level, or three-level page table? Why? Compute the average size of a page table in part c above
page addressing (a) The following are virtual 16 Considered bit-addresses, with the upper 8th Bit the number of the page and the lower one 8th Bit represent the offset. The physical memory included in this example 256 Page frames ( frames ) to each 256 Bytes per page, ie physical addresses from 0x0000 to 0xFFFF, where frame 0 at 0x0000 starts. Given the following page table for a process that 10 Pages (page numbers 0 - 9), some of which...
1. Assume that your machine uses 16-bit virtual address and 14-bit physical address with 4KB page size. To get full credit, show your work. a. Show bits of the virtual address and physical address. b. What is the maximum program size that can be run in this machine? c. What is the maximum physical memory that this machine can have? d. Show the numbers of virtual pages and page frames. e. What is the table size if a page entry...
Please answer the following questions about paged memory... A) How much space needs to be allocated in the minimum and maximum cases for a two-level page table for a machine with a 32-bit virtual memory address, a 1K page size, and which has four times as many inner pages as outer pages? Assume any stored page table value requires 32 bits. B) For the two-level paging approach above, if a Translation Lookaside Buffer (TLB) is used and can cache both...
A machine has a 16-bit byte-addressable virtual address space. The page size is 8 KB. How many pages of virtual address space exist? (25 points)
A system implements a paged virtual address space for each process using a one-level page table. The maximum size of virtual address space is 8MB. The page table for the running process includes the following valid entries (the -> notation indicates that a virtual page maps to the givenpage frame, that is, it is located in that frame): Virtual page 2 -> Page frame4 Virtual page 4 -> Page frame 9 Virtual page 1 -> Page frame2 Virtual page 3...