A tree-based scheduling algorithm for control-dominated circuits

Abstract

Scheduling algorithms for control dominated applications have not been widely published. Path-based scheduling was the first attempt to tackle this problem. This approach works well on the benchmark examples. However, it imposes a restriction on the execution order of the operations before scheduling. We alleviate this restriction by representing all the execution paths by a tree. states as compared with previous algorithms.