A Macrotask-level Unlimited Speculative Execution on Multiprocessors
(17/19)
The following description is based on the paper presented at
1995 ACM International Conference on Supercomputing head
in Spain on July 3rd to 7th,1995.
If you want to have the copy of the paper, please
let me know.
The workload is shown here. The program has three basictasks, each of
which has dummy instructions which costs 0.96us. As shown in this figure,
the program forms a Boolean recurrence loop. When the one side of the
direction is selected continuously, the data dependence is also continuous.
However, once the branch direction is selected alternately, there exit
no data dependence between iterations.
After applying the macrotask creation scheme, we have 4 macrotasks.