adplus-dvertising
frame-decoration

Question

Delays arising from the use of a load result 1 or 2 cycles after the loads, refers as

a.

Data stall

b.

Control stall

c.

Branch stall

d.

Load stall

Posted under Computer Architecture

Answer: (d).Load stall

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Delays arising from the use of a load result 1 or 2 cycles after the loads, refers as

Similar Questions

Discover Related MCQs

Q. Situations that prevent the next instruction in the instruction stream, from executing during its designated clock cycle are known as

Q. The simplest dynamic branch-prediction scheme is a

Q. When an instruction is guaranteed to complete, it is called

Q. An implementation technique whereby multiple instructions are overlapped in execution, refers to

Q. Grouping the 16 functional units together into four groups and supplying a set of buses, called

Q. Example: the number of cars per hour and is determined by how often a completed car exits the assembly line, shows the

Q. To improve the ability of the compiler to fill branch delay slots, most processors with conditional branches have introduced a

Q. Pipelining that allows to achieve higher clock rates by decomposing the five-stage integer pipeline into eight stages, is refered as

Q. When all instructions take the same number of cycles, which must also equal the number of pipeline stages the process is known as

Q. Exceptions that are caused by some hardware event that is not under the control of the user program, refered as

Q. Hazards in pipelines can make it necessary to

Q. Indicating which of the four steps the instruction is in, is provided by

Q. In pipelines with long-running operations, the possible caused issue is called

Q. The effective pipeline speedup with branch penalties, assuming an ideal CPI of 1, is

Q. For execution, branch instructions require 2 cycles, store instructions require 4 cycles, and all other instructions require

Q. If the stages are perfectly balanced, then the time per instruction on the pipelined processor, is equal to

Q. If the buffer is a queue with multiple instructions, it stalls when the queue

Q. Instruction used in sequences to implement a more complex instruction set, is called a

Q. A processor with separate decode and register fetch stages will probably have a

Q. If some combination of instructions cannot be accommodated because of resource conflicts, the processor is said to have a