1. Consider a paging system with the Page Map Table (PMT) stored in physical memory. a) If access time to the memory is 100 nanoseconds, how long does a paged memory reference takes? b) If we add associative registers to store the whole PMT in the associative registers. Calculate the Effective Access Time (EAT) if the associative memories search time is 10 nanoseconds.
1. Consider a paging system with the Page Map Table (PMT) stored in physical memory. a) If access time to the memory is 100 nanoseconds, how long does a paged memory reference takes? b) If we add associative registers to store the whole PMT in the associative registers. Calculate the Effective Access Time (EAT) if the associative memories search time is 10 nanoseconds.
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
![Question 6:
1. Consider a paging system with the Page Map Table (PMT) stored in physical memory.
a) If access time to the memory is 100 nanoseconds, how long does a paged memory reference
takes?
b) If we add associative registers to store the whole PMT in the associative registers.
Calculate the Effective Access Time (EAT) if the associative memories search time is 10
nanoseconds.
2. Consider a CPU that uses 20 bits to represent the logical addresses. Assume that we want
to implement a paging mechanism where the page size is 2Kbytes. (Hint 1 kilobyte (Kb) = 2^10 bytes
= 1,024 bytes. 1 megabyte (MB) = 2^20 bytes = 1,048,576 bytes. 1 gigabyte (GB) = 2^30 bytes = 1,073,741,824 bytes)
a) What is the size of the logical space in bytes?
b) How many bits is used for the page number?
c) Give the physical address translation to the logical address 5000 if we assume the following
PMT
Page number
Frame number
1
1
2
3
3
Show the calculation steps:
d) Assume an OS is using LRU page replacement strategy with 3 pages' frames for the
following list of references 2, 1, 3, 4, 1, 2, 5, 1, 2, 3. Give the page replacement sequence
and the number of page faults. Fill the replacement table.
e) If access to the physical memory is 100 nanoseconds and the fault service time is 1ms,
compute the Effective Access Time for the whole list of references.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd6e26675-7aba-46e4-b843-60aed06f39fd%2Fa856df55-1fb1-4ef5-b437-17d20c6f90f8%2F3riec4h_processed.png&w=3840&q=75)
Transcribed Image Text:Question 6:
1. Consider a paging system with the Page Map Table (PMT) stored in physical memory.
a) If access time to the memory is 100 nanoseconds, how long does a paged memory reference
takes?
b) If we add associative registers to store the whole PMT in the associative registers.
Calculate the Effective Access Time (EAT) if the associative memories search time is 10
nanoseconds.
2. Consider a CPU that uses 20 bits to represent the logical addresses. Assume that we want
to implement a paging mechanism where the page size is 2Kbytes. (Hint 1 kilobyte (Kb) = 2^10 bytes
= 1,024 bytes. 1 megabyte (MB) = 2^20 bytes = 1,048,576 bytes. 1 gigabyte (GB) = 2^30 bytes = 1,073,741,824 bytes)
a) What is the size of the logical space in bytes?
b) How many bits is used for the page number?
c) Give the physical address translation to the logical address 5000 if we assume the following
PMT
Page number
Frame number
1
1
2
3
3
Show the calculation steps:
d) Assume an OS is using LRU page replacement strategy with 3 pages' frames for the
following list of references 2, 1, 3, 4, 1, 2, 5, 1, 2, 3. Give the page replacement sequence
and the number of page faults. Fill the replacement table.
e) If access to the physical memory is 100 nanoseconds and the fault service time is 1ms,
compute the Effective Access Time for the whole list of references.
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
![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