C. J. Tseng et. al. Bridge: A Versatile Behavioral Synthesis System. In DAC, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....thus the command logic can be synthesized. Figure 3 describes the flow of tasks in the overall high level synthesis of data path and control. 2 Control Specification The work in [5] dealt with the automatic production of control specifications for non pipelined data path. Another system, Bridge[6], performs data path and control path allocation by applying either a local slicing or a global slicing technique for non pipelined systems. Another work for non pipelined systems is reported in [7] In this paper, we present a method which synthesizes a Moore style FSM controller specifications ....

C.Tseng et al. Bridge: a versatile behavioral synthesis system. In Proc. 25th DAC, 1988.

....scheduled before, after, or in the same control step as the condition of the branch. Scheduling of operations in conditional branches to available operators, even before the branch is decided, can increase the component utilization factor and reduce total number of control 30 steps in the design [17]. In addition, number of control steps on the critical path can be reduced if the scheduled operations are on the critical path [3, 8] For example, Figure 14(a) shows the scheduling of the branch condition (A B) which is to be used in ( A B) C) and a computation in a branch (C 3 J) in the ....

C.-J. Tseng, R.W. Wei, S.G. Rothweiler, M. Tong and A.K. Bose, "Bridge: A Versatile Behavioral Synthesis System," Proc. 25th DAC., pp.415-420, 1988.

....loops) that make use of complex data types, e.g. integers, arrays, and records) Most systems synthesize designs from such descriptions by associating each language construct with a particular hardware structure. For example, conditional branches and loops are translated to control structures [5, 7, 9, 14], while operations in basic blocks are executed in a datapath [7, 12] Because of the close relationship between language constructs and the synthesis algorithms the design quality obtained from these systems is dependent on the input description. In other words, semantically equivalent ....

....dependent on the input description. In other words, semantically equivalent descriptions that differ syntactically could result in distinctively different designs. Let us consider systems, which evaluate conditions of a branch statement in the control step that precedes operations in the branches [5, 7, 9, 14, 18]. Results generated by these systems depend on the way conditional branches are ordered or grouped in the input description. For example, Figure 1(a) shows two descriptions that have the same semantics but different ordering of conditional branches. When scheduling Description1 and Description2 ....

[Article contains additional citation context not shown here]

C.-J. Tseng, R.W. Wei, S.G. Rothweiler, M. Tong and A.K. Bose, "Bridge: A Versatile Behavioral Synthesis System," Proc. 25th DAC., pp.415-420, 1988.

....an optimization possibility. It refers to the possibility of sharing hardware resources (i.e. storage elements, interconnects and functional units) if these resources are used under mutually exclusive conditions. Several scheduling algorithms taking advantage of it, have been proposed (e.g. 3] [4], 5] 6] 7] Mutual exclusiveness is the key concept enabling conditional resource sharing. These approaches suffer from several drawbacks; principally the limited dataflow analysis, and the sensitivity to the syntactic variance of the input descriptions. In [1] 2] several of these ....

C.J. Tseng, R.S. Wei, S.G. Rothweiler, M.M Tong, A.K. Bose, "Bridge: A Versatile Behavioral Synthesis System", Proc. of the 25th ACM/IEEE DAC, pp. 415-420, Jun. 1988

....of functional units, scheduling of operations into various control steps and binding the operations and interconnects into the appropriate units. There have been many research efforts in the areas of scheduling, allocation and binding, that have resulted in powerful algorithms for these tasks [1, 5, 7, 8, 9, 10, 11]. Most of these systems accept either unit constraints or performance constraints during synthesis. Some of the other algorithms [17] minimize the register to register delays to satisfy the given clock constraint. However the above algorithms do not consider the strong relationship that exists ....

C.-J. Tseng, R.W. Wei, S.G. Rothweiler, M. Tong and A.K. Bose, "Bridge: A Versatile Behavioral Synthesis System," Proc. 25th DAC., pp.415-420, 1988.

....Operator pairs f 1 , 7 g, f 1 , 8 g, f 1 , 9 g, f 2 , 3 g, f 2 , 4 g, f 2 , 7 g, f 2 , 8 g, and f 2 , 9 g are data flow m.e. pairs. 2 1.1 Related Work Kim and Liu [3] proposed an algorithm that can identify mutually exclusive operators based on language constructs. In [4] status bits are assigned to determine the active basic blocks. The mutual exclusiveness of two basic blocks are determined by checking the intersection of the active cube sets of their status bits. These two approaches only identify structural m.e. pairs. Wakabayashi and Yoshimura proposed a ....

....condition graph to solve this problem which perform better than other previous approaches. However, their approach also fails to identify all data flow m.e. pairs. Table 1: A comparison of m.e. operator pairs identified by different approaches. mutually approaches exclusive operators Kim s [3] SB [4] CV [5] path based [6] CG [2] TDT f 1 , 7 g p p f 1 , 8 g p p f 1 , 9 g p p f 2 , 3 g p p f 2 , 4 g p p f 2 , 7 g p p p f 2 , 8 g p p p f 2 , 9 g p p p f 3 , 5 g p p p f 3 , 6 g p p p f 4 , 5 g p p p p p p f 4 , 6 g p p p f 4 , 7 g p p p p p p f 4 , 8 g p ....

[Article contains additional citation context not shown here]

C.-J. Tseng, R.-S. Wei, S. G. Tothweiler, M. M. Tong, and A. K. Bose, "Bridge: A versatile behavioral synthesis system," in Proceedings of the 25 th Design Automation Conference, pp. 84-- 87, 1988.

....we also manually run other approaches on the same example. In Table 6, we list all the m.e. operator pairs and mark those identified by each approach in a corresponding column. In the table, Kim s approach refers to Kim and Liu s approach [16] Approach SB stands for the status bit approach [22]. Approach CV refers to condition vector approach [17] The approach path based refers to an approach based on path analysis [23] Approach CG stands for the usage condition approach using condition graphs [15] Finally, approach TDT refers to our approach based on TDT modeling and def use ....

C.-J. Tseng, R.-S. Wei, S. G. Tothweiler, M. M. Tong, and A. K. Bose, "Bridge: A versatile behavioral synthesis system," in Proceedings of the 25 th Design Automation Conference, pp. 84-- 87, 1988.

....applications of M1 and M2. When these moves are applied, the incremental cost adjustment must be recalculated for each operator that is moved, adding to the expense of shoving moves. 3. 6 Conditionals, Subroutines, and Loops SALSA represents conditional activities using an approach similar to [26,27], as shown in Fig. 9. A list of input conditions is attached to each operation that represents the conditions under which it is activated. Each row of this list represents a set of input conditions encoded as 0, 1, or X (either 1 or 0) The universal condition (XXX) is attached to unconditional ....

C. Tseng, R. Wei, S. Rothweiler, M. Tong, and A. Bose, "Bridge: a Versatile Behavioral Synthesis System", Proceedings 25th DAC, pp. 415-420, June 1988.

No context found.

C. J. Tseng et. al. Bridge: A Versatile Behavioral Synthesis System. In DAC, 1988.

No context found.

Tseng. "Bridge: A Versatile Behavioral Synthesis System". Proc. of 25th ACM/IEEE Design Automation Conference (1988), 415-420.

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