Solution :
4/A :
Number of pages = size of virtual memory / size of a page
= 2^32 / 16 KBytes
= 2^32 / 2^14
= 2^18
4/B :
Number of page frames = size of physical memory / size of a
page
= 2^26 / 16 KBytes
= 2^26 / 2^14
= 2^12
4/C :
Number of bits used for each page entry = number of bits used for
page frame number + number of extra bits
= 12 + 2 (one is dirty bit and another is present/absent bit)
= 14 bits
Size of page table = number of pages in virtual memory * number
of bits used for each entry
= 2^18 * 14 bits
2^18 * 16 bits
= 2^18 * 2^4
= 2^22 bits
= 2^19 bytes
= 512 KBytes.
Answer : ( around )512 KB
if you have any doubts then you can ask in comment section if you find the solution helpful then upvote the answer. Thank you.
4. Assume that we have a machine with the following memory specifications: Virtual addresses are 32...
Consider a virtual memory system with the following properties: 36 bit virtual byte address, 8 KB pages size, and 32 bit physical byte address. Please explain how you determined your answer. a. What is the size of main memory for this system if all addressable frames are used? b. What is the total size of the page table for each process on this processor, assuming that the valid, protection, dirty, and use bits take a total of 4 bits and...
Exercise l: Suppose that we have a virtual memory space of 28 bytes for a given process and physical memory of 4 page frames. There is no cache. Suppose that pages are 32 bytes in length. 1) How many bits the virtual address contain? How many bits the physical address contain? bs Suppose now that some pages from the process have been brought into main memory as shown in the following figure: Virtual memory Physical memory Page table Frame #...
computer architecture
Virtual memory 4 physice memar Assume a 64 bit machine with 40 bit addresses, and 16GB of actual memory. Memory blocks are 4K 1. How many bits in the virtual memory INDEX and OFFSET fields? 2. What fields do you need in a page table entry, and how many bits are needed for each? How many bytes do you need for each page table entry? (each entry is allocated in a whole number of bytes, even if there...
Question 1 Which of the following is true about virtual addresses? Virtual addresses for the same physical memory location may differ from process to process Virtual addresses are synonymous with physical addresses Virtual addresses always refer to locations on disk Virtual addresses for the same physical memory location may differ from thread to thread Question 2 How do pages and frames relate to each other? A page holds words while a frame holds pictures A frame is a larger structure...
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...
Suppose a memory manager employs paging with page size of 4 Kbytes. It has a memory of 256 Mbytes. A process of size 25 Kbytes needs to be loaded into memory. Answer the following. (a) How many frames are there in the memory? (b) How many bits are necessary to represent the physical address as <frame#, offset>? (c) How many frames need to be allocated to the process?
Suppose a memory manager employs paging with page size of 4 Kbytes....
The RISC-V 32-bit architecture supports virtual memory with 32-bit virtual addresses mapping to 32-bit physical addresses. The page size is 4Kbytes, and page table entries (PTEs) are 4 bytes each. Translation is performed using a 2-level page table structure. Bits 31:22 of a virtual address index the first-level page table. If the selected first-level PTE is valid, it points to a second-level page table. Bits 21:12 of the virtual address then index that second-level page table. If the selected second-level...
Suppose you have a byte-addressable virtual address memory system with 8 virtual pages of 64 bytes each, and 4-page frames. Assuming the following page table, answer the questions below: Page #Frame #Valid Bit0111312-03014215-06-07-0a) How many bits are in a virtual address? b) How many bits are in a physical address? c) What physical address corresponds to the following virtual addresses (if the address causes a page fault, simply indicate this is the case)? 1) Ox00 2) 0x44 3) OxC2 4) 0x80
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...
36.-Assume a 32 bit memory space with 16[KB] pages/frames and a two-level page table. Answer the following questions: a).-what is the size of the page table in bytes needed for a process that has only 64[MB] of code at the start of its virtual address range? b).-how many bits are used for address (frame) offset, and how many for page table indexing (total). Assume each page table entry has 32 bits. a).-Size of page table b).-Offset bits b).-Page table indexing...