Concept explainers
A.
Virtual address:
Virtual page number (VPN) and virtual page offset (VPO) are the two components of virtual address. Virtual address is “14 bits” format.
A.
Explanation of Solution
Given data:
Virtual address = 0x027C
The given virtual address is in hexadecimal format; convert it into binary format. Convert each Hexadecimal digit to a 4 bit binary equivalent:
| 0 | 2 | 7 | C |
| 0000 | 0010 | 0111 | 1100 |
The above binary values are filled in the virtual address 14 bits format as follows,
Virtual address format:
| 13 | 12 | 11 | 10 | 9 | 8 | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
| 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 |
B.
The page size (P) is 64bytes; using the page size finds the number of bits in VPN.
The formula for page size as follows:
Substitute “P = 64” in the above formula
Therefore, the “p” value represents virtual page offset (VPO) and physical page offset (PPO).
Number of bits in VPN is calculated as follows:
n = 14
p = 6
The VPN has additional two more components. They are TLB tag (TLBT) and TLB index (TLBI). The TLB is “4 ways” associative with “16” entries totally. Using the TLB find the value of TLBI and TLBT.
The formula for TLB as follows:
Substitute “T = 4” in the above formula
Therefore, the “t” value represents TLBI.
TLBI and TLBT are calculated as follows:
The “t” value represents TLBI. Therefore, the value of TLBI is “2”.
TLBI = 2
VPN = 8
Therefore, the value of TLBT is “6”.
B.
Explanation of Solution
Virtual address format:
| 13 | 12 | 11 | 10 | 9 | 8 | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
| 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 0 |
The higher-order “8 bits” of the virtual address represents “VPN” and the lower-order “6 bits” of the virtual address represents “VPO”. The higher-order “6 bits” of the VPN represents “TLBT” and the lower-order “2 bits” of the VPN represents “TLBI”
Value of VPN:
| 13 | 12 | 11 | 10 | 9 | 8 | 7 | 6 |
| 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 |
VPN = 0000 1001 = 0x9
Value of TLB index:
| 7 | 6 |
| 0 | 1 |
TLB index = 01 = 0x1
Value of TLB tag:
| 13 | 12 | 11 | 10 | 9 | 8 |
| 0 | 0 | 0 | 0 | 1 | 0 |
TLB tag = 00 0010 = 0x2
TLB hit: No
There is a no valid match in the virtual address.
Page fault: No
There is a valid PTE and returns the cached PPN from the page table (PTE).
Value of PPN:
The cached PPN from the page table is “0x17”.
Value of VPO:
| 5 | 4 | 3 | 2 | 1 | 0 |
| 1 | 1 | 1 | 1 | 0 | 0 |
VPO = 11 1100 = 3C
Completed Table:
| Parameter | Value |
| VPN | 0x9 |
| TLB index | 0x1 |
| TLB tag | 0x2 |
| TLB hit? (Y/N) | N |
| Page fault? (Y/N) | N |
| PPN | 0x17 |
C.
Physical address:
Physical page number (PPN) and physical page offset (PPO) are the two components of physical address. Physical address is “12 bits” format. The physical page offset (PPO) is identical to the virtual page offset (VPO).
C.
Explanation of Solution
Physical address format:
To form the physical address, concatenate the physical page number (PPN) from the PTE with virtual page offset (VPO) from the virtual address, which forms “0x05FC”.
Physical address = 0x05FC
The physical address is in hexadecimal format; convert it into binary format. Convert each Hexadecimal digit to a 4 bit binary equivalent:
| 0 | 5 | F | C |
| 0000 | 1011 | 1111 | 1100 |
The above binary values are filled in the physical address 12 bits format as follows,
| 11 | 10 | 9 | 8 | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
| 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 |
D.
The physical address has additional three more components. They are Byte offset within cache block (CO), Cache index (CI) and Cache tag (CT).
D.
Explanation of Solution
Physical address format:
| 11 | 10 | 9 | 8 | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
| 0 | 1 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 0 | 0 |
The lower-order “2 bits” of the physical address represents “CO”, the next “4 bits” represents “CI” and the remaining “6 bits” represents “CT”.
Value of Byte offset (CO):
| 1 | 0 |
| 0 | 0 |
CO = 11 = 0x0
Value of Cache index (CI):
| 5 | 4 | 3 | 2 |
| 1 | 1 | 1 | 1 |
CI = 1111 = 0xF
Value of Cache tag (CT):
| 11 | 10 | 9 | 8 | 7 | 6 |
| 0 | 1 | 0 | 1 | 1 | 1 |
CT = 01 0111 = 0x17
Cache hit: No
The cache index is not matches the cache tag.
Value of Cache byte:
The cached byte is not returned because the cache index is not matches the cache tag.
Completed Table:
| Parameter | Value |
| Byte offset | 0x0 |
| Cache index | 0xF |
| Cache tag | 0x17 |
| Cache hit? (Y/N) | N |
| Cache byte returned | --- |
Want to see more full solutions like this?
Chapter 9 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
- using r languagearrow_forwardI need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules: • No column may contain the same value twice. • No row may contain the same value twice. Each square in the sudoku is assigned to a variable as follows: We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm. Turning the Problem into a Circuit To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules. Since we need to check both columns and rows, there are four conditions to verify: v0 ≠ v1 # Check top row v2 ≠ v3 # Check bottom row…arrow_forward1 Vo V₁ V3 V₂ V₂ 2arrow_forward
- I need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules: • No column may contain the same value twice. • No row may contain the same value twice. Each square in the sudoku is assigned to a variable as follows: We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm. Turning the Problem into a Circuit To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules. Since we need to check both columns and rows, there are four conditions to verify: v0 ≠ v1 # Check top row v2 ≠ v3 # Check bottom row…arrow_forwardI need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules: • No column may contain the same value twice. • No row may contain the same value twice. Each square in the sudoku is assigned to a variable as follows: We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm. Turning the Problem into a Circuit To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules. Since we need to check both columns and rows, there are four conditions to verify: v0 ≠ v1 # Check top row v2 ≠ v3 # Check bottom row…arrow_forwardI need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules: • No column may contain the same value twice. • No row may contain the same value twice. Each square in the sudoku is assigned to a variable as follows: We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm. Turning the Problem into a Circuit To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules. Since we need to check both columns and rows, there are four conditions to verify: v0 ≠ v1 # Check top row v2 ≠ v3 # Check bottom row…arrow_forward
- Don't use ai to answer I will report you answerarrow_forwardYou can use Eclipse later for program verification after submission. 1. Create an abstract Animal class. Then, create a Cat class. Please implement all the methods and inheritance relations in the UML correctly: Animal name: String # Animal (name: String) + getName(): String + setName(name: String): void + toString(): String + makeSound(): void Cat breed : String age: int + Cat(name: String, breed: String, age: int) + getBreed(): String + getAge (): int + toString(): String + makeSound(): void 2. Create a public CatTest class with a main method. In the main method, create one Cat object and print the object using System.out.println(). Then, test makeSound() method. Your printing result must follow the example output: name: Coco, breed: Domestic short-haired, age: 3 Meow Meowarrow_forwardautomata theory can please wright the exact language it know for example say it knows strings start 0 and end with 1 this is as example also as regular expressionarrow_forward
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage