A scheduling algorithm for conditional resource sharing-a hierarchical reduction approach
T. Kim, Noritake Yonezawa, J.W.S. Liu, C. L. Liu · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1994
A new scheduling algorithm for dataflow graphs with nested conditional branches is presented. The algorithm employs a bottom-up approach to transform a dataflow graph with conditional branches into an "equivalent" one that has no conditional branches. A schedule is then obtained for the latter, using a conventional scheduling algorithm, from which a schedule for the former is derived. Our approach is particularly effective when there is a large number of nested conditional branches in a dataflow graph.>