A comparison of two policies for issuing instructions speculatively

Value speculation is a speculative technique proposed to reduce the execution time of programs. It relies on a predictor, a checker and a recovery mechanism. The predictor predicts the result of an instruction in order to issue speculatively its dependent instructions, the checker checks the prediction after issuing the predicted instruction, and the recovery mechanism deals with mispredictions in order to maintain program correctness.Previous works on value speculation have considered that the instructions dependent on a predicted instruction can be issued before issuing the predicted instruction (non-delayed issue policy). In this work we propose delaying the issue time of the instructions dependent on a value-predicted instruction until issuing the value-predicted instruction (delayed issue policy). Although the potential performance benefits of the delayed issue policy are smaller than that of the non-delayed issue policy, the recovery mechanism required by the delayed issue policy is simpler than the recovery mechanism required by the non-delayed issue policy.We have evaluated both issue policies in the context of load-value prediction by means of address prediction in order to determine in which scenarios the performance of the delayed issue policy is competitive with that of the non-delayed issue policy. Our results show that the delayed policy is a cost-effective alternative to the non-delayed policy, especially for realistic issue-queue sizes.