Question

8. (5 points) 10.21 Assume we have a demand-paged memory. The page table is held in registers. It takes 8 milliseconds to ser

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Let p be the page faulit sate Pobabity that a memorj access esults in a poge fauvt- (A-p) -> bsobability -Ihat a memorq acce100 164001o o 6 = 6.IXIO = 0.00061 % Scannedwith CamScanner Cs

Add a comment
Know the answer?
Add Answer to:
8. (5 points) 10.21 Assume we have a demand-paged memory. The page table is held in...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Problem 4 (13 points) Assume we have a demand-paged memory. Assume that the time needed to access...

    Problem 4 (13 points) Assume we have a demand-paged memory. Assume that the time needed to access the page table is negligible. It requires 8 milliseconds to handle a page fault if an empty page is available or the replaced page is not dirty, and 20 milliseconds if the replaced page is dirty. Memory access time is 100 nanoseconds. Assume that the page to be replaced is dirty 70 percent of the time. What is the maximum acceptable page-fault rate...

  • 3. Consider a paging system with the page table in memory. A. If a memory reference...

    3. Consider a paging system with the page table in memory. A. If a memory reference takes 100 nanoseconds, how long does a paged memory reference take? B. If we add TLBs, and 75 percent of all page-table references are found in the TLBs, what is the effective memory reference time? (Assume that finding a page-table entry for the TLBs takes 20 nanoseconds.) C. It takes 750 milliseconds to service a page fault. The page fault rate is .001. What...

  • Question # 3 Consider a demand-paged system where the page table for each process resides in main...

    Question # 3 Consider a demand-paged system where the page table for each process resides in main memory. In addition, there is a fast associative memory (also known as TLB which stands for Translation Look-aside Buffer) to speed up the translation process. Each single memory access takes 1 microsecond while each TLB access takes 0.2 microseconds. Assume that 2% of the page requests lead to page faults, while 98% are hits. On the average, page fault time is 20 milliseconds...

  • 3. Consider a paging system with the page table in memory. A. If a memory reference takes 100 nanoseconds, how long does...

    3. Consider a paging system with the page table in memory. A. If a memory reference takes 100 nanoseconds, how long does a paged memory reference take? B. If we add TLBs, and 75 percent of all page-table references are found in the TLBs, what is the effective memory reference time? (Assume that finding a page-table entry for the TLBs takes 20 nanoseconds.) C. It takes 750 milliseconds to service a page fault. The page fault rate is .001. What...

  • Regarding demand paging, assume an average page fault service time = 25 ms and a memory...

    Regarding demand paging, assume an average page fault service time = 25 ms and a memory access time of 100 ns (ms = milliseconds, 1/1000 sec; ns = nanoseconds, 1/1,000,000,000 sec). Calculate the effective access time in ns. Given a page fault rate of 1/1000, calculate the factor by which the computer would be slowed down over not incurring any page fault.

  • Problem 3 (25 points): Consider a paging system with the page table stored in memory. Ifa...

    Problem 3 (25 points): Consider a paging system with the page table stored in memory. Ifa memory reference takes 200 nanoseconds, how long does a paged memory reference take? If we add associative registers, and 75 percent of all page-table references are found in the associative registers, what is the effective memory reference time? (Assume that finding a page-table entry in the associative registers takes zero time if the entry is there.) a. b.

  • Question 17 5 pts Assume we have primary memory access time of 82 nanoseconds, and a...

    Question 17 5 pts Assume we have primary memory access time of 82 nanoseconds, and a solid state disk with which memory access time on a swap is 107 microseconds. Compute the effective memory access time at a 0.07 page fault rate. Give your answer in nanoseconds using numbers only, and to two decimal places if necessary. Question 18 5 pts Assume we have primary memory access time of 96 nanoseconds, and a magnetic fixed disk with which memory access...

  • Answer the following questions a) If average page-fault service time is 9 milliseconds, a memory access...

    Answer the following questions a) If average page-fault service time is 9 milliseconds, a memory access time is 202 nanoseconds, and the page fault rate is 0.2% then what is the effective access time (in nanoseconds) for a demand paging scheme. b) Under what circumstances do page faults occur? Describe the actions taken by the operating system when a page fault occurs.

  • Consider a demand-paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of...

    Consider a demand-paging system with a paging disk that has an average access and transfer time of 20 milliseconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference, if the page-table entry is in the associative memory. Assume that 80...

  • Please answer the following questions about paged memory... A) How much space needs to be allocated...

    Please answer the following questions about paged memory... A) How much space needs to be allocated in the minimum and maximum cases for a two-level page table for a machine with a 32-bit virtual memory address, a 1K page size, and which has four times as many inner pages as outer pages? Assume any stored page table value requires 32 bits. B) For the two-level paging approach above, if a Translation Lookaside Buffer (TLB) is used and can cache both...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT