Explore a tree, in recursive decomposition fashion.
Example: Given a set of integers, find, if possible, a partition into two subsets of equal sum.
The solution is a backtracking algorithm. To parallelize it, the backtracking search space is divided between the threads. Solution: subset_sum_async.cpp.
Processing is divided in stages; the output of one stage is fed as input in the next stage.
Pipeline can be generalized to any DAG.
Radu-Lucian LUPŞA