Q. For every instruction present in the buffer, prediction accuracy is

View solution

Q. Between the instruction ADD.D and the instruction SUB.D, there is

View solution

Q. By-passing and Forwarding techniques, reduces the

View solution

Q. In the PARSEC benchmarks, SMT energy gets reduced by

View solution

Q. The final stage of completion of an instruction, after which merely the result remains, is known

View solution

Q. The execution time for the unrolled loop, has been dropped to a total of

View solution

Q. The most common, often implemented technique of multithreading, is called

View solution

Q. An alternative towards the fine-grained multithreading, the devised technique was

View solution

Q. In the (0,2) branch predictor, having 4K entries, the bits are

View solution

Q. A increasing scheme for the number of instructions, relative to the overhead and branch instructions is

View solution

Q. Allowing multiple instructions for issuing in a clock cycle, is the goal of

View solution

Q. For predicting the value which will be produced by an instruction, this stated technique is referred as

View solution

Q. Attempts for predicting the result of a computation used technique, is called

View solution

Q. In the scheme, named as Tomasulo

View solution

Q. Computing the miss penalties, for every system, the formula which can be used is

View solution

Q. The given instruction: L.D F0,0(R1), gets the state of execution in

View solution

Q. If f0 is the array element then adding the scalar in F2, can be calculated as

View solution

Q. When branches are being mis-predicted; hazard which is raised due to this issue, is known as

View solution

Q. Considering the following code: DIV.D F0,F2,F4; ADD.D F10,F0,F8; SUB.D F12,F8,F14, one statement that is true

View solution

Q. Branch predictors using the behavior of all other branches for making a prediction, are called

View solution