adplus-dvertising
frame-decoration

Question

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

a.

Time per instruction on unpipelined machine/ no of piped stages

b.

Time per instruction on unpipelined machine* no of piped stages

c.

Time per instruction on unpipelined machine + no of piped stages

d.

Time per instruction on unpipelined machine - no of piped stages

Posted under Computer Architecture

Answer: (a).Time per instruction on unpipelined machine/ no of piped stages

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

Q. Assume that processor has a 1 ns clock cycle and that it uses 4 cycles for ALU operationsand branches and 5 cycles for memory and the relative frequencies of these operations are 40%, 20%, and 40%, respectively, then the average instruction execution time on the unpipelined processor is

Q. The instruction in different stages of the pipeline do not interfere with one another, the separation is done by

Q. MIPS pipeline with the appropriate registers, called pipeline registers or also known as

Q. Pipeline interlock introduces a stall or bubble, just as in the

Q. The time required between moving an instruction one step down the pipeline is a

Q. A floating-point divider, a floating-point multiplier, and a floating-point adder, are the parts of a

Q. The execution cycle with a branch, delay of one is

Q. The hazards in the pipelined stages are of

Q. Register $2 written by subtraction can be written in the instruction

Q. The term specifying both the programs and the relative frequencies is known as

Q. When multiple-instructions are overlapped during execution of the program, then function performed is called

Q. An instruction that does no operation for changing state is known as

Q. Pipeline stalling concept is often given the name of

Q. The instruction being read from memory using the address placed in the PC and then is placed in the IF/ID pipeline register in,

Q. Predicting branches at runtime by using run-time information, is known as

Q. To discard instructions in the pipeline is referred to as