Software Synthesis from Dataflow Graphs

Pirmais vāks
Springer Science & Business Media, 1996. gada 31. maijs - 190 lappuses
Software Synthesis from Dataflow Graphs addresses the problem of generating efficient software implementations from applications specified as synchronous dataflow graphs for programmable digital signal processors (DSPs) used in embedded real- time systems. The advent of high-speed graphics workstations has made feasible the use of graphical block diagram programming environments by designers of signal processing systems. A particular subset of dataflow, called Synchronous Dataflow (SDF), has proven efficient for representing a wide class of unirate and multirate signal processing algorithms, and has been used as the basis for numerous DSP block diagram-based programming environments such as the Signal Processing Workstation from Cadence Design Systems, Inc., COSSAP from Synopsys® (both commercial tools), and the Ptolemy environment from the University of California at Berkeley.
A key property of the SDF model is that static schedules can be determined at compile time. This removes the overhead of dynamic scheduling and is thus useful for real-time DSP programs where throughput requirements are often severe. Another constraint that programmable DSPs for embedded systems have is the limited amount of on-chip memory. Off-chip memory is not only expensive but is also slower and increases the power consumption of the system; hence, it is imperative that programs fit in the on-chip memory whenever possible.
Software Synthesis from Dataflow Graphs reviews the state-of-the-art in constructing static, memory-optimal schedules for programs expressed as SDF graphs. Code size reduction is obtained by the careful organization of loops in the target code. Data buffering is optimized by constructing the loop hierarchy in provably optimal ways for many classes of SDF graphs. The central result is a uniprocessor scheduling framework that provably synthesizes the most compact looping structures, called single appearance schedules, for a certain class of SDF graphs. In addition, algorithms and heuristics are presented that generate single appearance schedules optimized for data buffering usage. Numerous practical examples and extensive experimental data are provided to illustrate the efficacy of these techniques.

No grāmatas satura

Saturs

I
1
II
2
III
3
IV
6
V
10
VI
13
VII
16
VIII
21
XXIII
91
XXIV
93
XXV
94
XXVI
103
XXVII
105
XXVIII
113
XXIX
119
XXXI
122

IX
23
X
29
XI
30
XII
33
XIII
37
XIV
48
XV
49
XVII
57
XVIII
60
XIX
62
XX
70
XXI
82
XXII
85
XXXII
125
XXXIII
134
XXXIV
139
XXXV
141
XXXVI
147
XXXVII
154
XXXVIII
159
XXXIX
161
XL
169
XLI
170
XLII
171
Autortiesības

Citi izdevumi - Skatīt visu

Bieži izmantoti vārdi un frāzes

Populāri fragmenti

182. lappuse - SISAL: Streams and Iteration in a Single Assignment Language, Language Reference Manual Version 1.2.
183. lappuse - Pino, S. Ha, EA Lee, and JT Buck. Software synthesis for DSP using Ptolemy.
183. lappuse - PK Murthy. SS Bhattacharyya. and EA Lee, "Combined code and data minimization for synchronous dataflow programs," Journal of Formal Methods in System Design, July 1997.

Bibliogrāfiskā informācija