The time per instruction cycle in a pipelined system is given by: \[ {Cycle time} = \max({Stage delays}) + {Latch delay} \] Step 1: Given Data - Stage delays: \( 180, 250, 150, 170, 250 \) ns - Maximum stage delay: \( 250 \) ns - Inter-stage latch delay: \( 10 \) ns
Step 2: Compute Cycle Time \[ {Cycle time} = 250 + 10 = 260 { ns} \] Step 3: Compute Total Execution Time Since the pipeline fills in the first 5 cycles, the total execution time for \( n \) instructions is: \[ {Time} = ({Pipeline fill time} + (n - 1) \times {Cycle time}) \] \[ = (5 \times 260) + (999 \times 260) \] \[ = 1300 + 259740 = 261040 { ns} = 261.04 { µs} \] Thus, the answer is between \( 260.20 \) and \( 261.20 \) µs.
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?
According to the map shown in the figure, which one of the following statements is correct?
Note: The figure shown is representative.
In the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and the line QR. What is the ratio of the area of the triangle PST to the area of the trapezium SQRT?
Note: The figure shown is representative
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)