J. Zhu and D. D. Gajski, "Soft Scheduling in High Level Synthesis," in Proceedings of the 36th Design Automation Conference, 1994, pp. 219--224. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Soft Scheduling in High Level Synthesis - Jianwen Zhu Daniel (1998) (1 citation) Self-citation (Zhu Gajski) (Correct)
.... v q.in[k] null q.in[k] v (c) d) e) f) prev v q q q prev v q prev v q p p Figure 2: Update of scheduling state. 4.3 Algorithm Analysis In this section, we study the correctness, optimality and complexity of Algorithm 1. For space reason, Interest readers are referred to [12] for proofs of claims. We first establish the relationship between the precedence graph this implemented by Algorithm 1 and our definition of a threaded schedule. Definition 6 A function F : VG Theta SF 7 SF is a schedule of precedence graph G implemented by Algorithm 1 if 8S 2 SF is formed by ....
J. Zhu, D.D. Gajski. Soft Scheduling in High Level Synthesis. Technical Report ICS-98-37, Information and Computer Science, UC, Irvine, August, 1998.
Energy and Transient Power Minimization during Behavioral Synthesis - Mohanty (2003) (Correct)
No context found.
J. Zhu and D. D. Gajski, "Soft Scheduling in High Level Synthesis," in Proceedings of the 36th Design Automation Conference, 1994, pp. 219--224.
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