R. A. Bergamaschi, A. Raje, I. Nair, and L. Trevillyan, "Control-flow versus data-flow scheduling: Combining both approaches in an adaptive scheduling system," IEEE Trans. VLSI Systems, vol. 8, pp. 82--100, Mar. 1997.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Comprehensive High-level Synthesis System for.. - Wang, Tan, Luo.. (2003) (3 citations) (Correct)
....control flow graph (CFG) and CDFG. While the CFG model is well suited for capturing execution of instructions on a general purpose uniprocessor, it has been shown to be inadequate in exploiting the parallelism inherent in typical control flow intensive applications. Existing CDFG models [7, 8] are successful in preserving the parallelism in the behavior. However, the implementation complexity of using such a CDFG is much higher compared to that of using a CFG. Based on these observations, we propose our own CDFG model, which is a variation of the CDFG model proposed in [7] it ....
R. A. Bergamaschi, A. Raje, I. Nair, and L. Trevillyan, "Control-flow versus data-flow scheduling: Combining both approaches in an adaptive scheduling system," IEEE Trans. VLSI Systems, vol. 8, pp. 82--100, Mar. 1997.
Incorporating Speculative Execution into Scheduling of .. - Ganesh.. (1998) (1 citation) (Correct)
....into a single schedule while attempting to minimize the number of controller states. Enhancements to path based scheduling, including re ordering operations within basic blocks to exploit data flow information, and control partitioning to avoid explosion in the number of paths are presented in [17]. Symbolic scheduling [18] attempts to represent all possible solutions to the scheduling problem, i.e. all feasible schedules, using ordered binary decision diagrams (OBDDs) While the quality of solutions is optimal or close to optimal, the size of the representation may become unmanageable for ....
R. Bergamaschi, S. Raje, I. Nair, and L. Trevillyan, "Control-flow versus data-flow scheduling: Combining both approaches in an adaptive scheduling system," IEEE Trans. VLSI Systems, vol. 5, pp. 82--100, Mar. 1997.
Wavesched: A Novel Scheduling Technique For.. - Lakshminarayana.. (1997) (7 citations) (Correct)
....that can effectively use the flexibility afforded by the CDFG representation is essential in exploiting parallelism in the input description. Details of our scheduling algorithm, which satisfies the above criterion, can be found in Section 3. Note that, in this case, the algorithm described in [6], while partially addressing the limitations of CFG based scheduling, would not significantly improve the performance of the schedule over that of LDS because it is restricted to reordering of operations within basic blocks. At this stage, we would like to point out that some synthesis systems do ....
R. Bergamaschi, S. Raje, I. Nair, and L. Trevillyan, "Controlflow versus data-flow scheduling: Combining both approaches in an adaptive scheduling system," IEEE Trans. VLSI Systems, vol. 5, pp. 82--100, Mar. 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC