Tools for computing parallel reductions on data flow graphs.
Aho, A. V. and Garey, M. R. and Ullman, J. D. (1972), "The Transitive Reduction of a Directed Graph", SIAM J. Comput. 1(2), p. 131
McCreary, C. and Gill, H. (1989), "Automatic Determination of Grain Size for Efficient Parallel Processing", CACM 32(9), pp. 1073--1078.
McCreary, C. and Gill, H. (1990), "Efficient Exploitation of Concurrency Using Graph Decomposition", Auburn University Technical Report CSE-90-03.
Sarkar, V. (1991), "Automatic Partitioning of a Program Dependence Graph into Parallel Tasks", IBM J. Research and Development 35(5.6), pp. 779--804.