Q. The eliminating stage of WAR and WAW hazards, is often called

View solution

Q. The maximum performance measurement, attainable by the implementation is

View solution

Q. The goal of software techniques and hardware techniques, is to exploit

View solution

Q. A branch-prediction cache which is used to store the predicted address for the upcoming instruction after the branch, is called a

View solution

Q. Hardware-based speculation method for executing programs, is necessarily a

View solution

Q. When an instruction starts execution and when it ends execution; between these two times, the instruction is in

View solution

Q. The operation for performing on source operands, S1 and S2 is given by the well-known field,

View solution

Q. Simple technique which predicts if two stores or a load and a store referred to the exact memory address is called

View solution

Q. The actual dataflow values among instructions, which produce results and those that consume those results, is known as

View solution

Q. For every instruction present in the buffer, prediction accuracy is

View solution

Q. Between the instruction ADD.D and the instruction SUB.D, there is

View solution

Q. By-passing and Forwarding techniques, reduces the

View solution

Q. In the PARSEC benchmarks, SMT energy gets reduced by

View solution

Q. The final stage of completion of an instruction, after which merely the result remains, is known

View solution

Q. The execution time for the unrolled loop, has been dropped to a total of

View solution

Q. The most common, often implemented technique of multithreading, is called

View solution

Q. An alternative towards the fine-grained multithreading, the devised technique was

View solution

Q. In the (0,2) branch predictor, having 4K entries, the bits are

View solution

Q. A increasing scheme for the number of instructions, relative to the overhead and branch instructions is

View solution

Q. Allowing multiple instructions for issuing in a clock cycle, is the goal of

View solution