Question

Question # 3 Consider a demand-paged system where the page table for each process resides in main memory. In addition, there

0 0
Add a comment Improve this question Transcribed image text
βœ” Recommended Answer
Answer #1

We know that:

Effective Memory Access Time = TLB hit ratio * (TLB access time + Main memory access time) +

(1 – hit ratio) * (TLB access time + 2 * main memory access time)

TLB hit ratio = (TLB hits) / (Number of queries into TLB)

= 80/98 = 0.816 (approx.)

So, the Effective Memory Access Time is

= (80/98)*(0.2+1)+(1-(80/98))*(0.2+2*1) Microseconds

= (0.816*1.2)+(0.184*2.2) Microseconds

= (0.9792 + 0.4048) Microseconds

= 1.384 Microseconds

Hope this helps.

Add a comment
Know the answer?
Add Answer to:
Question # 3 Consider a demand-paged system where the page table for each process resides in main...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Similar Homework Help Questions
  • 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...

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

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

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

  • Number Name 3. Assuming no page fault on a page table access, what is the processor...

    Number Name 3. Assuming no page fault on a page table access, what is the processor memory access time for the system depicted in the above figure, for a physical memory with 50ns read/write times? 4. Now, assume that the memory system has a translation look-aside buffer (TLB). The TLB requires 10 ns to determine a hit or mess. The physical memory system has an access time of 50ns. You may assume that page fault rate for the application is...

  • Consider the following system: Byte addressable 16-bit addresses 256B pages Single level Page Table System The...

    Consider the following system: Byte addressable 16-bit addresses 256B pages Single level Page Table System The system utilizes a fully-associative TLB with 4 entries and an LRU replacement policy. Given the access pattern and timings below, complete the following table. Assume the TLB begins initially empty and the cache is physically addressed NOTE: Access times are not inclusive and components are accessed sequentially. Time to update the TLB is negligible, everything else that needs to be updated will require a...

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

  • a computer system has a 1KB page size and keeps the page table for each process...

    a computer system has a 1KB page size and keeps the page table for each process in main memory. Because the page table entries are usually cached on chip the average overhead for doing a full page table lookup is 40 ns. To reduce this overhead the computer has a 32 entry TLB. A TLB looup reqiures 1 ns . what TLB hit rate is reqiured to ensure an average virtual address translation time of 2 ns?

  • Q5. Consider a memory system where all pages fit in memory. The TLB takes 15 nanoseconds...

    Q5. Consider a memory system where all pages fit in memory. The TLB takes 15 nanoseconds to access and memory takes 120 nanoseconds to access. What is the effective access time for 1 level paging if the hit rate is 65%? What if it’s 95%? What is the effective access time if not all processes fit into memory and the swap time is 850,000 nanoseconds for a page fault?

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