Suppose we have 210 bytes of virtual memory and 28 bytes of physical main memory. Suppose the page size is 24 bytes. a) How many pages are there in virtual memory? b) How many page frames are there in main memory? c) How many entries are in the page table for a process that uses all of virtual memory?

Suppose we have 210 bytes of virtual memory and 28 bytes of physical main memory. Suppose the page size is 24 bytes. a) How many pages are there in virtual memory? b) How many page frames are there in main memory? c) How many entries are in the page table for a process that uses all of virtual memory?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 26VE

See similar textbooks

Similar questions

If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the fetch cycle is 40% of the processor cycle time, what memory access speed is required to implement load operations with zero wait states and load operations with two wait states?
21. Suppose we have 210 bytes of virtual memory and 28 bytes of physical main memory. Suppose the page size is 24 bytes. a) How many pages are there in virtual memory? b) How many page frames are there in main memory? c) How many entries are in the page table for a process that uses all of virtual memory?
Consider an operating system that uses 48-bit virtual addresses and 16KB pages. The system uses a hierarchical page table design to store all the page table entries of a process, and each page table entry is 4 bytes in size. What is the total number of pages that are required to store the page table entries of a process, across all levels of the hierarchical page table?
4. Suppose a computer using a fully associative cache has 2^24 byte of byte-addressable main memory and a cache of 128 blocks, where each block contains 64 bytes. a) How big in kilobytes is main memory? b) How big in bytes is cache? In kilobytes? c) How many blocks of main memory are there? d) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag and offset fields? e) To which cache block will the memory address 0x01D8729A map?
. Suppose we have 2 bytes of virtual memory and 28 bytes of physical main memory. Suppose the page size is 24 bytes.Q.) How many entries are in the page table for a process that uses all of virtual memory?
Suppose a computer using fully associative cache has 220 words of main memory and a cache of 128 blocks, where each cache block contains 16 words. (a) How many blocks of main memory are there? (b) What is the format of a memory address as seen by the cache, that is, what are the sizes of the tag and word fields? (c) To which cache block will the memory reference 01D872_{16} map?
Consider an operating system that uses 48-bit virtual addresses and 16KB pages. The system uses a multi-level page table design to store all the page table entries of a process, and each page table entry and index entry are 4 bytes in size. What is the total number of page that are required to store the page table entries of a process, across all levels of the page table? You may follow the hint below or finish from scratch to fill the blanks. Please show your calculations to get partial points like 2^10/2^4=2^6. 1. We need to calculate the total number of page table entries needed for a process (i.e., the total number of pages for a process) 2. We need to calculate how many entries each page can store 3. With 1 and 2, we can calculate how many pages needed for the lowest (innermost) level 4. Each page from 3 requires an entry (pointer) in the upper (next) level. We need to calculate how many pages are required to store this next level entries (please note the entry size is always 4…
9. Consider a system that uses 32-bit addresses and page table structures as discussed in class. If the address space of a process contains exactly 256 pages, what is the minimum number of pages that might be needed for its page table structure? What is the maximum number that might be needed? Briefly explain your answer.
Suppose a computer using fully associative cache has 4G bytes of byte-addressable main memory and a cache of 512 blocks, where each cache block contains 128 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag and offset fields? c) To which cache block will the memory address 0x018072 map?
Consider a computer with byte-addressable main memory of size 8 GB and page size of 1 KB. Assume a process P has a virtual address space from 0 to 3653 (decimal). Determine the width of the virtual address , the width of the page # field and the width of the offset field (Note: enter only the numbers e.g. 8 for 8 bits etc.)
Suppose a computer using fully associative cache has 4 Gbytes of byte-addressable main memory and a cache of 256 blocks, where each cache block contains 32 bytes. a) How many blocks of main memory are there? b) What is the format of a memory address? Provide the names and the sizes of the fields. c) To which cache block will the memory address 0x01752 map?
Suppose a computer using fully associative cache has 224 words of main memory and a cache of 512 blocks, where each cache block contains 16 words. How many blocks of main memory are there? What is the format of a memory address as seen by the cache, i.e., what are the sizes of the tag and offset fields? To which cache block will the memory reference 17042416 map?