Description: Software Synthesis from Dataflow Graphs Please note: this item is printed on demand and will take extra time before it can be dispatched to you (up to 20 working days). Author(s): Shuvra S. Bhattacharyya, Praveen K. Murthy, Edward A. Lee Format: Paperback Publisher: Springer-Verlag New York Inc., United States Imprint: Springer-Verlag New York Inc. ISBN-13: 9781461286011, 978-1461286011 Synopsis 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 (R) (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.
Price: 73.05 GBP
Location: Aldershot
End Time: 2025-02-05T09:04:21.000Z
Shipping Cost: 39.32 GBP
Product Images
Item Specifics
Return postage will be paid by: Buyer
Returns Accepted: Returns Accepted
After receiving the item, your buyer should cancel the purchase within: 60 days
Return policy details:
Book Title: Software Synthesis from Dataflow Graphs
Number of Pages: 190 Pages
Publication Name: Software Synthesis from Dataflow Graphs
Language: English
Publisher: Springer-Verlag New York Inc.
Item Height: 235 mm
Subject: Engineering & Technology, Computer Science
Publication Year: 2011
Type: Textbook
Item Weight: 318 g
Subject Area: Electrical Engineering
Author: Shuvra S. Bhattacharyya, Edward A. Lee, Praveen K. Murthy
Item Width: 155 mm
Series: The Springer International Series in Engineering and Computer Science
Format: Paperback
