Consider a multi-level memory management scheme with the following format for virtùal addresses: Virtual Page # (10 bits) Virtual Page # (20 bits) Offset (12 bits) Virtual addresses are translated into physical addresses of the following form: Physical Page # (20 bits) Offset (12 bits) Page table entries (PTE) are 32 bits in the following format, stored in big-endian form in memory (i.e., the MSB is first byte in memory): OS Physical Page# (20 bits) defined (3 bits) Here, "Virtual" means that a translation is valid, "Writeable" means that the page is writeable, "User" means that the page is accessible by the User (rather than only by the Kernel). Note: the phrase "page table" in the following questions means the multi-level data structure that maps virtual addresses to physical addresses. (b) Suppose that we want an address space with one physical page at the top of the address space and one physical page at the bottom of the address space. How big would the page table be (in bytes)? (a) How big is a page? (c) What is the maximum size of a page table (in bytes) for this scheme?
Consider a multi-level memory management scheme with the following format for virtùal addresses: Virtual Page # (10 bits) Virtual Page # (20 bits) Offset (12 bits) Virtual addresses are translated into physical addresses of the following form: Physical Page # (20 bits) Offset (12 bits) Page table entries (PTE) are 32 bits in the following format, stored in big-endian form in memory (i.e., the MSB is first byte in memory): OS Physical Page# (20 bits) defined (3 bits) Here, "Virtual" means that a translation is valid, "Writeable" means that the page is writeable, "User" means that the page is accessible by the User (rather than only by the Kernel). Note: the phrase "page table" in the following questions means the multi-level data structure that maps virtual addresses to physical addresses. (b) Suppose that we want an address space with one physical page at the top of the address space and one physical page at the bottom of the address space. How big would the page table be (in bytes)? (a) How big is a page? (c) What is the maximum size of a page table (in bytes) for this scheme?
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
100%
Answer only a) and b) part .
Correct answer will be upvoted else downvoted.
![Consider a multi-level memory management scherne with the following format
for virtual addresses:
Virtual Page #
(10 bits)
Virtual Page #
Offset
(20 bits)
(12 bits)
Virtual addresses are translated into physical addresses of the following form:
Physical Page #
(20 bits)
Offset
(12 bits)
Page table entries (PTE) are 32 bits in the following format, stored in big-endian formin memory
(i.e., the MSB is first byte in memory):
Physical Page#
(20 bits)
OS
defined
(3 bits)
Here, "Virtual" means that a translation is valid, "Writeable" means that the page is writeable,
"User" means that the page is accessible by the User (rather than only by the Kernel). Note: the
phrase “page table" in the following questions means the multi-level data structure that maps
virtual addresses to physical addresses.
(b) Suppose that we want an address space with one physical page at the top of the address
space and one physical page at the bottom of the address space. How big would the page
table be (in bytes)?
(a) How big is a page?
(c) What is the maximum size of a page table (in bytes) for this scheme?
Valid
-----
Writeable
User
---
Write](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F648429ae-2216-4242-adc7-627013b123cb%2F61b0c740-6c03-4011-9ac2-4df918390496%2F6hf71ec_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Consider a multi-level memory management scherne with the following format
for virtual addresses:
Virtual Page #
(10 bits)
Virtual Page #
Offset
(20 bits)
(12 bits)
Virtual addresses are translated into physical addresses of the following form:
Physical Page #
(20 bits)
Offset
(12 bits)
Page table entries (PTE) are 32 bits in the following format, stored in big-endian formin memory
(i.e., the MSB is first byte in memory):
Physical Page#
(20 bits)
OS
defined
(3 bits)
Here, "Virtual" means that a translation is valid, "Writeable" means that the page is writeable,
"User" means that the page is accessible by the User (rather than only by the Kernel). Note: the
phrase “page table" in the following questions means the multi-level data structure that maps
virtual addresses to physical addresses.
(b) Suppose that we want an address space with one physical page at the top of the address
space and one physical page at the bottom of the address space. How big would the page
table be (in bytes)?
(a) How big is a page?
(c) What is the maximum size of a page table (in bytes) for this scheme?
Valid
-----
Writeable
User
---
Write
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY