| S. Haynal. Automata-Based Symbolic Scheduling. PhD thesis, University of California, Santa Barbara, December 2000. |
....with the advent of systems on a chip, system level behavioral modeling in high level languages is being used for initial system specification and analysis. All these factors have led to a renewed interest in high level synthesis from behavioral descriptions, both in the industry and in academia [1, 2, 3, 4, 5]. However, current synthesis efforts have several limitations: Synthesizability is guaranteed on a small, constrained sub set of the input language and the language level optimizations are few and their effects on final circuit area and speed are not well understood. Also, for designs with ....
....type of designs and demonstrated their effects on schedule lengths. CVLS [13] uses condition vectors to improve resource sharing among mutually exclusive operations. Radivojevic et al. 14] present an exact symbolic formulation that generates an ensemble schedule of valid, scheduled traces. Haynal [4] uses an automata based approach for symbolic scheduling of cyclic behaviors under sequential timing and protocol constraints. This is an exact approach, but can grow exponentially in terms of internal representation size. The Waveschedule approach [15] incorporates speculative execution into ....
S. Haynal. Automata-Based Symbolic Scheduling. PhD thesis, University of California, Santa Barbara, 2000.
....source to source transformation phase and the scheduling phase. 1 Introduction Driven by the increasing size and complexity of digital designs, there has been a renewed interest in high level synthesis of digital circuits from behavioral descriptions both in the industry and in academia [1, 2, 3, 4, 5]. Recent years have seen the widespread acceptance and use of language level modeling of digital designs. A high level language such as a behavioral HDL (hardware description language) or C allows for additional freedom in the way a behavior is described compared to register transfer level (RTL) ....
S. Haynal. Automata-Based Symbolic Scheduling. PhD thesis, University of California, Santa Barbara, 2000.
No context found.
S. Haynal. Automata-Based Symbolic Scheduling. PhD thesis, University of California, Santa Barbara, December 2000.
No context found.
S Haynal, "Automata-based symbolic scheduling," Ph.D. dissertation, Dept. Elect. Comput. Eng., Univ. California,S anta Barbara, 2000.
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