The formula for average memory access time (AMAT) in a system with two cache levels is: \[ {AMAT} = {Hit time}_{L1} + {Miss rate}_{L1} \times ({Hit time}_{L2} + {Miss rate}_{L2} \times {Miss penalty}_{L2}) \] Step 1: Given Data - \( {Hit time}_{L1} = 1 \) ns - \( {Hit rate}_{L1} = 0.90 \Rightarrow {Miss rate}_{L1} = 1 - 0.90 = 0.10 \) - \( {Hit time}_{L2} = 10 \) ns - \( {Hit rate}_{L2} = 0.80 \Rightarrow {Miss rate}_{L2} = 1 - 0.80 = 0.20 \) - \( {Miss penalty}_{L2} = 100 \) ns
Step 2: Compute AMAT \[ {AMAT} = 1 + (0.10 \times (10 + (0.20 \times 100))) \] \[ = 1 + (0.10 \times (10 + 20)) \] \[ = 1 + (0.10 \times 30) = 1 + 3 = 4.0 { ns} \]
Consider a system with the following: - \(\mathbb{P} = \{ P_1, P_2, P_3, P_4 \}\) consists of all active processes in an operating system. - \(\mathbb{R} = \{ R_1, R_2, R_3, R_4 \}\) consists of single instances of distinct types of resources in the system.
The resource allocation graph has the following assignment and claim edges: Assignment edges: \[ R_1 \to P_1, \quad R_2 \to P_2, \quad R_3 \to P_3, \quad R_4 \to P_4 \] (The assignment edge \( R_1 \to P_1 \) means resource \( R_1 \) is assigned to process \( P_1 \), and so on for others.)
Claim edges: \[ P_1 \to R_2, \quad P_2 \to R_3, \quad P_3 \to R_1, \quad P_2 \to R_4, \quad P_4 \to R_2 \] (The claim edge \( P_1 \to R_2 \) means process \( P_1 \) is waiting for resource \( R_2 \), and so on for others.)
Which of the following statement(s) is/are CORRECT?
A disk of size 512M bytes is divided into blocks of 64K bytes. A file is stored in the disk using linked allocation. In linked allocation, each data block reserves 4 bytes to store the pointer to the next data block. The link part of the last data block contains a NULL pointer (also of 4 bytes). Suppose a file of 1M bytes needs to be stored in the disk. Assume, 1K = \(2^{10}\) and 1M = \(2^{20}\). The amount of space in bytes that will be wasted due to internal fragmentation is ___________. (Answer in integer)
Three villages P, Q, and R are located in such a way that the distance PQ = 13 km, QR = 14 km, and RP = 15 km, as shown in the figure. A straight road joins Q and R. It is proposed to connect P to this road QR by constructing another road. What is the minimum possible length (in km) of this connecting road?
Note: The figure shown is representative.