1989
DOI: 10.1109/29.46557
|View full text |Cite
|
Sign up to set email alerts
|

Gabriel: a design environment for DSP

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

1990
1990
2012
2012

Publication Types

Select...
4
4
2

Relationship

1
9

Authors

Journals

citations
Cited by 78 publications
(17 citation statements)
references
References 15 publications
0
17
0
Order By: Relevance
“…Such a Scheduler will not always work with DDF Stars. SDF is an appropriate model for multirate signal processing systems with rationally-related sampling rates throughout [3], and is the model used exclusively in Ptolemy's predecessor system Gabriel [19] [2]. The advantages of SDF are ease of programming (since the availability of data tokens is static and doesn't need to be checked), a greater degree of setup-time syntax checking (since sample-rate inconsistencies are easily detected by the system), run-time efficiency (since the ordering of Block invocation is statically determined at setup-time rather dynamically at run-time), and automatic parallel scheduling [29][30] [20].…”
Section: Heterogeneity: the Domainmentioning
confidence: 99%
“…Such a Scheduler will not always work with DDF Stars. SDF is an appropriate model for multirate signal processing systems with rationally-related sampling rates throughout [3], and is the model used exclusively in Ptolemy's predecessor system Gabriel [19] [2]. The advantages of SDF are ease of programming (since the availability of data tokens is static and doesn't need to be checked), a greater degree of setup-time syntax checking (since sample-rate inconsistencies are easily detected by the system), run-time efficiency (since the ordering of Block invocation is statically determined at setup-time rather dynamically at run-time), and automatic parallel scheduling [29][30] [20].…”
Section: Heterogeneity: the Domainmentioning
confidence: 99%
“…An SST has an associated parameter set K. Nodes within the schedule tree can be parameterized in terms of this parameter set (we will describe this in more detail below). The semantics of how SST parameters (i.e., values associated with elements of K) change is not specified in the SST model; rather, it is determined by the model of computation that is used for application specification (e.g., SDF with static graph parameters [25], parameterized dataflow [14], or scenario aware dataflow [26]), in conjunction with the scheduling strategy that is used to derive the schedule tree. This decoupling from parameter change semantics allows the SST model to be applied to a variety of different kinds of dataflow application models and design environments.…”
mentioning
confidence: 99%
“…Commercial tools that employ SDF semantics include Simulink by The Math Works, SPW by Cadence, and ADS by Hewlett Packard. SDF-based research tools include Gabriel [32] and several key domains in Ptolemy [16], from U.C. Berkeley; and ASSIGN from Carnegie Mellon [40].…”
Section: Examplementioning
confidence: 99%