Title
Software Synthesis from Dataflow Graphs (The Springer International Series in Engineering and Computer Science, 360),New
Processing time: 1-3 days
US Orders Ships in: 3-5 days
International Orders Ships in: 8-12 days
Return Policy: 15-days return on defective items
Payment Option
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 highspeed 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 diagrambased 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 realtime DSP programs where throughput requirements are often severe. Another constraint that programmable DSPs for embedded systems have is the limited amount of onchip memory. Offchip 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 onchip memory whenever possible.Software Synthesis from Dataflow Graphs reviews the stateoftheart in constructing static, memoryoptimal 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 singleappearance 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.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.