Question
a.
Canceling
b.
Branch history buffer
c.
Branch history table
d.
Branch prediction table
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. The simplest dynamic branch-prediction scheme is a
Similar Questions
Discover Related MCQs
Q. When an instruction is guaranteed to complete, it is called
View solution
Q. An implementation technique whereby multiple instructions are overlapped in execution, refers to
View solution
Q. Grouping the 16 functional units together into four groups and supplying a set of buses, called
View solution
Q. Example: the number of cars per hour and is determined by how often a completed car exits the assembly line, shows the
View solution
Q. To improve the ability of the compiler to fill branch delay slots, most processors with conditional branches have introduced a
View solution
Q. Pipelining that allows to achieve higher clock rates by decomposing the five-stage integer pipeline into eight stages, is refered as
View solution
Q. When all instructions take the same number of cycles, which must also equal the number of pipeline stages the process is known as
View solution
Q. Exceptions that are caused by some hardware event that is not under the control of the user program, refered as
View solution
Q. Hazards in pipelines can make it necessary to
View solution
Q. Indicating which of the four steps the instruction is in, is provided by
View solution
Q. In pipelines with long-running operations, the possible caused issue is called
View solution
Q. The effective pipeline speedup with branch penalties, assuming an ideal CPI of 1, is
View solution
Q. For execution, branch instructions require 2 cycles, store instructions require 4 cycles, and all other instructions require
View solution
Q. If the stages are perfectly balanced, then the time per instruction on the pipelined processor, is equal to
View solution
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
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!