Software Synthesis from Dataflow Graphs - The Springer International Series in Engineering and Computer Science 360 (Hardback)
  • Software Synthesis from Dataflow Graphs - The Springer International Series in Engineering and Computer Science 360 (Hardback)
zoom

Software Synthesis from Dataflow Graphs - The Springer International Series in Engineering and Computer Science 360 (Hardback)

(author), (author), (author)
£109.99
Hardback 190 Pages / Published: 31/05/1996
  • We can order this from the publisher

Usually dispatched within 15 working days

  • This item has been added to your basket
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.

Publisher: Springer
ISBN: 9780792397229
Number of pages: 190
Weight: 1040 g
Dimensions: 234 x 156 x 12 mm
Edition: 1996 ed.

You may also be interested in...

Energy, the Subtle Concept
Added to basket
Analytical Mechanics
Added to basket
The Physics of Birdsong
Added to basket
Theory of Elastic Stability
Added to basket
Energy Myths and Realities
Added to basket
Introduction to Classical Mechanics
Added to basket
Einstein Gravity in a Nutshell
Added to basket
Turbulent Flows
Added to basket
£62.99
Paperback
Gravity
Added to basket
£9.99
Paperback
No Bullshit Guide to Math and Physics
Added to basket
Mechanics
Added to basket
£53.99
Paperback
Classical Mechanics
Added to basket
Chaos
Added to basket
£10.99
Paperback

Please sign in to write a review

Your review has been submitted successfully.