As a major result, we show the optimal balancing problem of acyclic data flow graphs is reduceable to a class of linear programming problem, the net­ work flow problem, for which well-known efficient algorithms exist.