| Peng Z. (1986) Synthesis of VLSI Systems with the CAMAD Design Aid. Proc 23th ACM/IEEE Design Automation Conf., p. 278-284. |
....type of algorithm starts with an initial schedule (e.g. maximally serial or maximally parallel) and applies transformations to it to obtain other schedules. These algorithms differ in how they choose transformations (e.g. using exhaustive search [4] branch and bound [19] or some heuristics [36]) The other type of algorithms, the iterative constructive ones, build up a schedule by adding operations one at a time till all the operations have been scheduled. These algorithms differ in how the next operation to be scheduled is chosen and into which control step it is put. The simplest way ....
Peng Z. (1986) Synthesis of VLSI Systems with the CAMAD Design Aid. Proc 23th ACM/IEEE Design Automation Conf., p. 278-284.
....process. This model describes computation steps separated by synchronization statements (e.g. wait statements in VHDL) The most critical step when synthesizing this type of circuit is scheduling. Examples of tools dedicated to Control Flow synthesis are CALLAS VOTAN [8] HIS [2] YSC [1] CAMAD [15], Olympus [13] and Amical [10] 1.2.2 Data Flow Dominated Circuits A typical Data Flow dominated design has minimal control but a large data path to perform operations. In this case a behavioral description is composed of parallel data flow operations. The most critical step when synthesizing ....
Z. Peng. Synthesis of VLSI Systems with the CAMAD Design Aid. In Proc. of 23rd Design Automation Conference, San Diego, USA., June 1986.
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