Question

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.

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

4) mamo auces Herce totol memo now ako Atored tauo eJOtud un o no neeal to acess Page - un main mermory Aod Best only o Oen

Add a comment
Know the answer?
Add Answer to:
Problem 3 (25 points): Consider a paging system with the page table stored in memory. Ifa...
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
  • 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...

  • 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...

  • 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...

  • Consider a demand-paging system in which the replacement of a page takes 20 milliseconds (access time...

    Consider a demand-paging system in which the replacement of a page takes 20 milliseconds (access time and data transfer). 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, a TLB is added to the system to reduces access time to one memory reference, if the page-table entry is in the associative memory. Assume that...

  • 8. (5 points) 10.21 Assume we have a demand-paged memory. The page table is held in...

    8. (5 points) 10.21 Assume we have a demand-paged memory. The page table is held in registers. It takes 8 milliseconds to service a page fault if an empty page is available or the replaced page is not modified, and 20 if the replaced page is modified. Memory access time is 100 nanoseconds. Assume that the page to be replaced is modified 70 percent of the time. What is the maximum acceptable page- fault rate for an effective access time...

  • Consider a demand-paging system with a paging disk that has an average access and transfer time...

    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...

  • 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...

  • 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...

  • 4. Assume it take 50 nanoseconds to resolve a memory reference when accessing the physical memory address directly. a) We designed a system using virtual addresses with page tables without a TLB. In...

    4. Assume it take 50 nanoseconds to resolve a memory reference when accessing the physical memory address directly. a) We designed a system using virtual addresses with page tables without a TLB. In other words, when fetching data from memory, the page table is accessed to get the PTE for translating an address, a translation is completed, and finally, a memory reference to the desired data is resolved. In this system, what is the effective memory reference time. Assume the...

  • 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