A task is enabled for execution by a processor when its results are required by another task that is also enabled; such as, a graph reduction model. A graph reduction programme consists of reducible expressions that are replaced by their computed values as the computation progresses through time. Most of the time, the reductions are done in parallel--nothing prevents parallel reductions except the availability of data from previous reductions. See also control flow model, data flow model.