Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

############## # Figure 4 # ############## A byte-oriented virtual memory system has the following characteristics. Virtual address: 32 bits Physical address: 36 bits Size of

############## #

Figure 4

# ############## A byte-oriented virtual memory system has the following characteristics. Virtual address: 32 bits Physical address: 36 bits Size of one page: 4 kilobytes The system uses a one-level page table. Each page table entry has three control bits (a valid bit, a referenced bit, and a modified bit) and three access bits (a read bit, a write bit, and an execute bit). The TLB is fully associative and contains 128 slots.

16. Consider the information in Figure 4. How many page frames are present in the system? A) 2^12 frames (4,096 frames) B) 2^16 frames (65,536 frames)

C) 2^20 frames (1,048,576 frames) D) 2^24 frames (16,777,216 frames) E) None of the above.

17. Consider the information in Figure 4. How many page table entries are contained in the page table? A) 2^12 entries (4,096 entries) B) 2^16 entries (65,536 entries)

C) 2^20 entries (1,048,576 entries) D) 2^24 entries (16,777,216 entries) E) None of the above.

18. Consider the information in Figure 4. How many bits does one page table entry contain? A) 26 bits B) 30 bits C) 44 bits D) 50 bits E) None of the above.

19. Consider the information in Figure 4. How many bits does one TLB slot contain? A) 26 bits B) 30 bits C) 44 bits D) 50 bits E) None of the above.

20. Consider the information in Figure 4. Which of the following statements about that virtual memory system is correct? A) It exploits temporal locality, but not spatial locality. B) It requires one 12-bit comparator per TLB slot.

C) It exploits spatial locality, but not temporal locality. D) It requires one 16-bit comparator per TLB slot.

E) It exploits both temporal locality and spatial locality.

Please explain not just answer. Figure 4 is "A byte....128 slots''. It is not a picture

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

1 2 3 Data Base Techniques

Authors: Dick Andersen

1st Edition

0880223464, 978-0880223461

More Books

Students also viewed these Databases questions