adplus-dvertising
frame-decoration

Question

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

a.

Loop rolling

b.

Loop unrolling

c.

Looping

d.

Unrooling

Posted under Computer Architecture

Answer: (b).Loop unrolling

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

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

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

Q. In the scheme, named as Tomasulo

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

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

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

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

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

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

Q. Detection of loop stream r micro-fusion is performed by

Q. Branch-target buffer having a single variation for storing one or more target instructions instead, or in addition to the predicted

Q. Out-of-order execution of the program, tends to introduce the possibility of

Q. Three different types of dependences are

Q. The property of if a value of the executed instruction would be used by a coming instruction, is called

Q. The processor without the structural hazard is

Q. In the following instruction set DADD R1,R2,R3; DSUB R4,R1,R5; AND R6,R1,R7; OR R8,R1,R9; XOR R10,R1,R11, all the instructions after the DADD use the result of the

Q. If any instruction in A1, . . . , A4, D, M1, . . . , M7 has the same register destination as this instruction, then the possible solution is

Q. The simplest scheme to handle branches is to

Q. Splitting the cache into separate instruction and data caches or by using a set of buffers, usually called