Question

In case of a TLB Miss, what would happen? a) The operating system will crash the...

In case of a TLB Miss, what would happen?

a) The operating system will crash the system

b) The operating system will raise an exception

c) The operating system will retrieve the missing page from the disk memory

d) The operating system will check the Page Table in search of the missed virtual address

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

The answer is D. TLB is the cache of the page table, so if there is TLB miss then we should retrieve this address from the page table.

Add a comment
Know the answer?
Add Answer to:
In case of a TLB Miss, what would happen? a) The operating system will crash the...
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
  • 18. You have a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associati...

    18. You have a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associative cache, and a page table for a process P. Assume cache blocks of 8 bytes and page size of 16 bytes. In the system below, main memory is divided into blocks, where each block is represented by a letter. Two blocks equal one frame. Given the system state as depicted above, answer the following questions: a) How many bits are in a virtual address...

  • A computer uses a byte-addressable virtual memory system with a four-entry TLB and a page table...

    A computer uses a byte-addressable virtual memory system with a four-entry TLB and a page table for a process P. Pages are 16 bytes in size. Main memory contains 8 frames and the page table contains 16 entries. a. How many bits are required for a virtual address? b. How many bits are required for a physical address?

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

  • Address Translation Question [8 points] Suppose a computing system uses paging with a logical add...

    Address Translation Question [8 points] Suppose a computing system uses paging with a logical address of 24 bits and a physical address of 32 bits. The page size is 4KB. Answer each of the following. If an answer is a power of 2, you can leave it in the form of a power of 2. ... 2. [20 points] Memory address translation and TLB performance [8 points] Suppose a computing system uses paging with a logical address of 24 bits...

  • Question 31 supus Given a computer using a byte-addressable virtual memory system with a two-entry TLB,...

    Question 31 supus Given a computer using a byte-addressable virtual memory system with a two-entry TLB, a 2-way set associative cache, and a page table for a process P. Assume cache blocks of size 16 bytes. Assume pages of size 32 bytes and a main memory of 4 frames. Assume the following TLB and page table for Process P: TLB 03 4 هما 0 1 2 3 4 5 6 7 Page Table f Vali d 1 1 0 2...

  • 1. A page fault is (check all that apply)... a) In the context of virtual memory,...

    1. A page fault is (check all that apply)... a) In the context of virtual memory, it is caused by an access to a virtual memory address that has yet to be mapped to physical memory. b) In the context of exceptions, when a page from the second level cache has to be loaded into the translation look-aside buffer. c) none of these d) In the context of virtual memory, it is caused by a miss in the page table....

  • As described in 5.7, virtual memory uses a page table to track the mapping of virtual...

    As described in 5.7, virtual memory uses a page table to track the mapping of virtual addresses to the physical addresses. This exercise shows how this table must be updated as addresses are accessed. The following data constitutes a stream of virtual addresses as seen on a system. Assume 4 KiB pages, a 4-entry fully associative TLB, and true LRU replacement. If pages must be brought in from disk, increment the next largest page number. 4669, 2227, 13916, 34587, 48870,...

  • Operating System a. What is the meaning of the term busy waiting? What other kinds of...

    Operating System a. What is the meaning of the term busy waiting? What other kinds of waiting are there in an operating system? Can busy waiting be avoided altogether? Explain your answers. (5 pts) b. Explain why spinlocks are not appropriate for single-processor systems yet are often used in multiprocessor systems. (5 pts) c. Using the program shown below, explain what the output will be at lines X and Y. Assume that you have a pre-emptive priority system. (10 pts)...

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

  • answer for all questions.... How do modern operating systems solve this? [3 marks] i) This is...

    answer for all questions.... How do modern operating systems solve this? [3 marks] i) This is a snapshot of a page table and a translation look aside buffer (TLB) of an operating system (Assume that these are the only populated entries). Toble 1: Page Table Entry Virtual Page Page Frame Time Loaded Time R bit M bit number Referenced 2 0 60 161 0 1 1 1 130 0 160 1 2 26 162 0 1 30 3 20 163...

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