Consider a system with 64 bit words, 48 bit addresses, 32GB of real memory and 4kB pages.
a) How many virtual pages are there?
b) How many page frames (real memory) are there?
c) How many entries are needed in the page table?
d) If each entry in the table requires 2 words, how big is the table?
Answer:
Given, 64 bit words, 48 bit addresses, 32 GB of real memory and 4kB pages.
a) How many virtual pages are there?
Total number of entries = number of virtual pages
Here word size = 64 bit = 2^6 , address size = 48 bit = 2^48
4kB = 2^2 x 2^10 = 2^12
virtual memory size = address size x word size = 2^48 x 2^6 = 2^54
Now, the number of virtual pages = virtual memory / page size = 2^54 / 2^12 x 2^3 (bytes) = 2^54 / 2^15 = 2^54-15 = 2^39 = 2^30 x 2 = 512G pages or simply 2^39 pages.
b) How many page frames (real memory) are there?
Page frames = real memory size/ page size = 32GB /4kB = 2^5 x 2^32 B / 2^2 x 2^10 = 2^35 -12 = 2^23 = 8 M page frames
c) How many entries are needed in the page table?
Number of entries = number of pages
We already got the number of pages = 2^39. Thus the number of entries = 2^39 or 512G
d) If each entry in the table requires 2 words, how big is the table?
Size of entry = 2 x word = 2 x 64 = 128 bits
Total size becomes :
entry size x number of entries = 128 x 2^39 = 2^7 x 2^39 = 2^46 bits
Now 2^46 bits , convert it into bytes = 2^46 / 2^3 = 2^43 bytes = 2^3 x 2^40 = 8 x TB = 8TB
Rate the answer ( as much needed for me) if it helps else let me know your doubts. Thank you!!!!
Consider a system with 64 bit words, 48 bit addresses, 32GB of real memory and 4kB...
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...
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...
4. Assume that we have a machine with the following memory specifications: Virtual addresses are 32 bits wide Physical addresses are 26 bits wide . Page size is 16 Kbytes 4/A) How many pages are in the virtual memory space? 4/B) How many page frames are in the physical memory space? 4/C) If each page table entry consists of a physical frame number, 1 present/absent bit Answers Pages .Page Frames and 1 dirty/clean bit (which shows if the page has...
Assume you have: 32-bit addresses, 4KB Page size, 4MB Physical Memory Space, 4KB Cache with 4-way set associative and LRU replacement, 32 Byte Cache block size, 4-entry fully associative TLB. A program to be run on this machine begins as follows: double A[1024]; int i, j; double sum = 0; for( i = 0; i < 1024; i++ ) // first loop A[i] = i; for( j = 0; j < 1024; j += 16 ) // second loop ...
PLEASE Solve problem 3. Thank you ction Reference 30% of all instructions are reads, 10% writes . All other instructions take 1 cycle. A. Calculate CPI for this machine. B. Changing the L1 cache to 4 way set associative increases the hit rate to 95% in L1 but added complexity of hardware means we must reduce the clock rate to 2.2GHZ. What is the CPI in this case? Is this change worthwhile? Virtual memory 3 Assume a 48 bit virtual...
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
Consider the page table shown below for a system with 16-bit virtual and physical addresses and with 4096-byte pages. All numbers below are given in hexadecimal. (A dash for a page frame indicates that the page is not in memory.) Page Number Physical Frame Number 0 - 1 2 2 C 3 A 4 - 5 4 6 3 7 - 8 B 9 0 How many bits are in the offset part of the address? How many hex digits...
1) The following page table illustrates a system with 12-bit virtual and physical addresses and 256-byte pages. Free page frames are to be allocated in the order9 F, D. A dash for a page frame indicates that the page is not in memory. (4 points) Page Page-Frame 0x4 OxB 0 2 4 0x2 0x0 0xC 7 Convert the following virtual addresses to their equivalent physical addresses irn hexadecimal. All numbers are given in hexadecimal. In the case of a page...
Consider the page table shown below for a system with 16-bit virtual and physical addresses and with 4096-byte pages. All numbers below are given in hexadecimal. (A dash for a page frame indicates that the page is not in memory.) Page Number Physical Frame Number 0 - 1 2 2 C 3 A 4 - 5 4 6 3 7 - 8 B 9 0 Convert the following virtual addresses to their equivalent physical addresses in hexadecimal. a) 9EF5 b)...
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...