Analysis and Critique of Reading Assignment 1 Paper “Limits of Instruction-Level Parallelism” In

700 WordsApr 23, 20193 Pages
Analysis and Critique of Reading Assignment 1 Paper “Limits of Instruction-Level Parallelism” In this report the author provides quantifiable results that show the available parallelism. The report defines various terminologies like Instruction Level parallelism, dependencies, Branch Prediction, Data Cache Latency, Jump prediction, Memory-address alias analysis etc. used clearly. A total of eighteen test programs with seven models have been examined and the results show significant effects of the variations on the standard models. The seven models reflect parallelism that is available by various compiler/architecture techniques like branch prediction, register renaming etc. The lack of branch prediction means that it finds intra-block…show more content…
Though this is a good way to increase the available parallelism, but loop unrolling schemes have difficulty in scheduling instructions efficiently with variable latency dependencies. The new techniques of dynamic history-based approach to increase parallelism is branch prediction allow us to benefit from a large branch predictor, enhancing success rates that are still improving slightly even when we are using a 1-megabit predictor. The fair model is relatively insensitive to the size of the predictor, though even a tiny 4-bit predictor improves the mean parallelism by 50%. The same is evident in case of the Great model wherein the three most parallel programs are quite insensitive to the size of the predictor. We look for paths of few conditional branches, up to the fanout limit, but that we do not look past branches beyond that point. After the fanout limit is reached dynamic prediction is used to look for instructions from the one predicted path to schedule. When fanout is followed by good branch prediction, the fanout does not affect much. Parallelism via jump prediction; Subroutine with return-ring technique are used. Smaller the return-prediction ring improves some programs a lot, even under the Great model. A large return ring,

More about Analysis and Critique of Reading Assignment 1 Paper “Limits of Instruction-Level Parallelism” In

Open Document