Unified static scheduling on various models

Given a behavioral description of an algorithm repretented by a data-flow graph, we show how to obtain a rateoptimal static schedule with the minimum unfolding factor under two timing models, integral grid model and fractional grid model, and two design styles for each model, pipelined design and non-pipelined design. We present a simple and unified approach to deal with the four possible combinations. A unified polynomial-time scheduling algorithm is presented, which works on the original data-flow graphs without really unfolding. The values of the minimum rateoptimal unfolding factors for all the four combinations are also derived.