Question
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
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
View solution
Q. Instruction used in sequences to implement a more complex instruction set, is called a
View solution
Q. A processor with separate decode and register fetch stages will probably have a
View solution
Q. If some combination of instructions cannot be accommodated because of resource conflicts, the processor is said to have a
View solution
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
View solution
Q. The instruction in different stages of the pipeline do not interfere with one another, the separation is done by
View solution
Q. MIPS pipeline with the appropriate registers, called pipeline registers or also known as
View solution
Q. Pipeline interlock introduces a stall or bubble, just as in the
View solution
Q. The time required between moving an instruction one step down the pipeline is a
View solution
Q. A floating-point divider, a floating-point multiplier, and a floating-point adder, are the parts of a
View solution
Q. The execution cycle with a branch, delay of one is
View solution
Q. The hazards in the pipelined stages are of
View solution
Q. Register $2 written by subtraction can be written in the instruction
View solution
Q. The term specifying both the programs and the relative frequencies is known as
View solution
Q. When multiple-instructions are overlapped during execution of the program, then function performed is called
View solution
Q. An instruction that does no operation for changing state is known as
View solution
Q. Pipeline stalling concept is often given the name of
View solution
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,
View solution
Q. Predicting branches at runtime by using run-time information, is known as
View solution
Q. To discard instructions in the pipeline is referred to as
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Computer Architecture? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!