Q. When every unit is fully pipelined, and a new operation can be started on each clock-cycle known as

View solution

Q. When elements are tends to be operated on in the dense form, then the sparse vector gets stored in an expanded form by a

View solution

Q. The vector instructions which can be potentially executed altogether, is known as

View solution

Q. If exploiting and finding the parallelism, across branches require scheduling code, a substantially very difficult algorithm is

View solution

Q. Having load before the store in a running program order, then interchanging this order, results in a

View solution

Q. When instruction i and instruction j are tends to write the same register or the memory location, it is called

View solution

Q. Branch-selected entries in a (2,2) predictor, which is having a total of 8K-bits in the prediction buffer are

View solution

Q. The 10-bit history is used for allowing patterns of up to

View solution

Q. Predictors taking this insight to the following level, by the use of multiple predictors; by combining Local and global Predictors, are called

View solution

Q. The local predictor contains the

View solution

Q. Hazards are eliminated through register renaming by renaming all

View solution

Q. Waiting until there is no data hazards, then

View solution

Q. If straight-line code is generated by un-rolling, then this stated technique, is known as

View solution

Q. The clock-cycle timings of the processors are 250 ps, 200 ps, and 400 ps, respectively, then it will have the miss penalties as

View solution

Q. Load and store instruction, waits until the

View solution

Q. The number of bits in a predictor: (m,n) is

View solution

Q. Combination of instructions, such as compare following a branch and combining them into a one-operation, is taken by

View solution

Q. The primary challenge for every multiple-issue processors is trying to exploiting large amount of

View solution

Q. A special hardware buffer is required for the instruction execution sequence, that holds the instruction results, this process is known as

View solution

Q. Determining the whole branch penalty for buffer of branch-target, assuming that the Hit rate and the Prediction accuracy is 90%

View solution