What is the purpose of a Translation Lookaside Buffer (TLB)? Group of answer choices To store the contents of physical memory. To store the contents of virtual memory. To cache recent virtual-to-physical address translations. To translate instructions into machine code.
Added by Alexis G.
Step 1
A TLB is a memory cache that stores recent translations of virtual memory addresses to physical memory addresses. Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 62 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
4. Consider a direct-mapped cache with 128 blocks and a block size of 16 bytes, and the page size is 1 KiB. Using the following virtual address (32-bits byte address) and TLB, answer the questions: Virtual address: 1200 TLB Valid | Tag | Physical Page Number 1 | 4 | 12 0 | 9 | 4 1 | 1 | 6 1 | 2 | 8 1 | 0 | 7 4-1. Convert the virtual address into the physical address (32-bits). 4-2. Calculate tag, index, and offset as decimal numbers.
Sri K.
2. A program is running on a computer with a four-entry fully associative translation lookaside buffer (TLB). Table 1 shows the contents of the TLB. An invalid entry (0) is treated as a TLB miss. Table 1: VP# PP# Entry valid 5 1 7 1 0 10 10 15 25 The table below (Table 2) is a trace of virtual page numbers accessed by a program. Table 2: Virtual page accessed TLB (hit or miss) Page table (hit or fault) 1 5 - 14 10 - 15 12 - 2 - - Table 3 below shows the virtual to physical address mapping. A page may be carried in the TLB. Table 3: Virtual page index Physical page Present 3 6 N 2 - + 14 30 - 26 11 - 13 18 - 10 56 - 110 33 - 12 25 - 8 - N 11 - N 15 - N For each access, indicate whether it produces a TLB hit or miss. If it accesses the page table, use LRU to replace TLB entries and create new entries for virtual to physical page translations when a TLB miss occurs. Assume that the entries in the TLB have the following LRU behaviors: Entry 1 is LRU (invalid), next LRU is entry 3, followed by entry 2 and entry zero. Extend the TLB shown.
Akash M.
Virtual Memory The following problem concerns the way virtual addresses are translated into physical addresses. The memory is byte addressable. The page size is 64 bytes. The TLB is 4-way set associative with a total of 16 entries. The cache is 2-way set associative, with a line size of 4 bytes and a total of 16 lines. Memory accesses are to 1-byte words (not 4-byte words). Virtual addresses are 15 bits wide, while physical addresses are 13 bits wide. Part 1 The box below shows the format of a virtual address. Indicate (by labeling the diagram) the fields (if they exist) that would be used to determine the following: (If a field doesn't exist, don't draw it on the diagram.) VPO - The virtual page offset VPN - The virtual page number TLBI - The TLB index TLBT - The TLB tag (a) 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 Remember to double-check your answer. The box below shows the format of a physical address. Indicate (by labeling the diagram) the fields that would be used to determine the following: PPO - The physical page offset PPN - The physical page number CO - The block offset within the cache line CI - The cache index CT - The cache tag (b) 12 11 10 9 8 7 6 5 4 3 2 1 0 Remember to double-check your answer.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD