A tree-based scheduling algorithm for control-dominated circuits
SongFa Huang, Yuang-Long Jeang, C.-T. Hwang, Y. C. Hsu, J. F. Wang · 1993
Scheduling algorithms for control dominated applialgorithm can be restricted to 0(pbn2 ), where p is the number of paths, b is the number of blocks and n is the number of operations.We tested the algorithm on a set of benchmarks and achieved reductions on the number of states as compared with previous algorithms.