Assume the following: TLB Page Table Set # Way #0 Way #1 Way #2 Way #3 0: V=Y;Tag=0x2a PPN=0x1c V=Y;Tag=0x2b PPN=0x29 V=Y;Tag=0x2c PPN=0x25 -- VPN PPN V? 0x0e 0x21 Y 0x0f 0x01 Y 0x10 0x38 Y 0x11 0x20 Y 0x12 0x3d Y 0x13 - - 0x14 - - 0x15 0x08 Y VPN PPN V? 0x16 0x1d Y 0x17 0x27 Y 0x18 - - 0x19 0x15 Y 0x1a 0x16 Y 0x1b 0x26 Y 0x1c - - 0x1d 0x36 Y VPN PPN V? 0x1e 0x10 Y 0x1f 0x3f Y 0x20 0x34 Y 0x21 0x09 Y 0x22 0x1b Y 0x23 0x2d Y 0x24 0x18 Y 0x25 0x39 Y VPN PPN V? 0x26 0x12 Y 0x27 0x22 Y 0x28 0x3a Y 0x29 0x00 Y 0x2a 0x1c Y 0x2b 0x29 Y 0x2c 0x25 Y 0x2d - - The memory is byte addressable. Memory accesses are to 1-byte words (not to 4-byte words). Virtual addresses are 15 bits wide. Physical addresses are 15 bits wide. The page size is 512 bytes. The TLB is 4-way associative tlb (E=4) with 1 sets (S=1) and a total of 4 entries . The TLB and a portion of the page table contents are as shown below Assume that memory address 0x599a has been referenced by a load instruction. Determine the virtual page number (VPN) and use that to compute the TLB index and tag that would be used to check the TLB for the translation entry. Indicate if the entry is in the TLB (Y/N). Indicate if the memory reference has a valid entry in the page table whether it hits in the TLB or not. Use the information from the page table to translate the VPN to a physical page number (PPN) and then the valid physical address (PA). For entries that can not be determined ( e.g. the PPN or PA if a translation doesn't exist), enter "-". Virtual Page Number (VPN) 0xAnswer Virtual Page Offset (VPO) 0xAnswer TLB Index (TLBI) 0xAnswer TLB Tag (TLBT) 0xAnswer TLB Hit (Y/N)? Answernoyes Valid Entry in Page Table (Y/N)? Answernoyes Physical Page Number (PPN) 0xAnswer Physical Address (PA) 0xAnswer
SQL
SQL stands for Structured Query Language, is a form of communication that uses queries structured in a specific format to store, manage & retrieve data from a relational database.
Queries
A query is a type of computer programming language that is used to retrieve data from a database. Databases are useful in a variety of ways. They enable the retrieval of records or parts of records, as well as the performance of various calculations prior to displaying the results. A search query is one type of query that many people perform several times per day. A search query is executed every time you use a search engine to find something. When you press the Enter key, the keywords are sent to the search engine, where they are processed by an algorithm that retrieves related results from the search index. Your query's results are displayed on a search engine results page, or SER.
Assume the following:
|
TLB |
Page Table |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
- The memory is byte addressable.
- Memory accesses are to 1-byte words (not to 4-byte words).
- Virtual addresses are 15 bits wide.
- Physical addresses are 15 bits wide.
- The page size is 512 bytes.
- The TLB is 4-way associative tlb (E=4) with 1 sets (S=1) and a total of 4 entries .
- The TLB and a portion of the page table contents are as shown below
Assume that memory address 0x599a has been referenced by a load instruction. Determine the virtual page number (VPN) and use that to compute the TLB index and tag that would be used to check the TLB for the translation entry. Indicate if the entry is in the TLB (Y/N).
Indicate if the memory reference has a valid entry in the page table whether it hits in the TLB or not.
Use the information from the page table to translate the VPN to a physical page number (PPN) and then the valid physical address (PA).
For entries that can not be determined ( e.g. the PPN or PA if a translation doesn't exist), enter "-".
|
Virtual Page Number (VPN) |
0xAnswer |
|
Virtual Page Offset (VPO) |
0xAnswer |
|
TLB Index (TLBI) |
0xAnswer |
|
TLB Tag (TLBT) |
0xAnswer |
|
TLB Hit (Y/N)? |
Answernoyes |
|
Valid Entry in Page Table (Y/N)? |
Answernoyes |
|
Physical Page Number (PPN) |
0xAnswer |
|
Physical Address (PA) |
0xAnswer |
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
