A Macrotask-level Unlimited Speculative Execution on Multiprocessors
(8/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.
Let me turn now to the next part.
Before going into the details of the scheme, let me explain the overview.
Firstly, a hierarchical task graph, in short HTG, is created from a
FORTRAN program. The hierarchical task graph, which is a direct acyclic
graph, has been proposed by Girkar and Polychronopolulos. HTG has plural
hierarchy levels, at the most deep level is called "bottom level". We call
the nodes in same hierarchy level "Basictask". After Creating HTG,
we duplicate and merge basictasks to create macrotasks which are unit
of speculation. Then, these macrotasks are executed on multiprocessors
with speculation.