A new resource constrained asynchronous scheduling method through transformation of dataflow graphs

With the increase of popularity in an asynchronous system design style, the request for asynchronous high-level synthesis tools is increasing continuously. In this paper, we suggest a new resource constrained asynchronous scheduling method which is performed through transformation of a dataflow graph (DFG). Experimental results show that the suggested scheduling method can produce a correct and efficient schedule from an initial DFG and the resulting schedule leads to a faster and more flexible asynchronous system compared to a corresponding synchronous system.