Software Synthesis from Dataflow Graphs

Name: Software Synthesis from Dataflow Graphs
Rating: 4.5 (2 reviews)

Shuvra S. Bhattacharyya · Praveen K. Murthy · Edward A. Lee

डिसें २०१२ · The Springer International Series in Engineering and Computer Science पुस्तक 360 · Springer Science & Business Media

४.५

२ परीक्षण

ई-पुस्तक

190

पेज

रेटिंग आणि परीक्षणे यांची पडताळणी केलेली नाही अधिक जाणून घ्या

या ई-पुस्तकाविषयी

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 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.

रेटिंग आणि पुनरावलोकने

४.५

२ परीक्षणे

या ई-पुस्तकला रेटिंग द्या

तुम्हाला काय वाटते ते आम्हाला सांगा.

वाचन माहिती

स्मार्टफोन आणि टॅबलेट

Android आणि iPad/iPhone साठी Google Play बुक अ‍ॅप इंस्‍टॉल करा. हे तुमच्‍या खात्‍याने आपोआप सिंक होते आणि तुम्‍ही जेथे कुठे असाल तेथून तुम्‍हाला ऑनलाइन किंवा ऑफलाइन वाचण्‍याची अनुमती देते.

लॅपटॉप आणि कॉंप्युटर

तुम्ही तुमच्या काँप्युटरचा वेब ब्राउझर वापरून Google Play वर खरेदी केलेली ऑडिओबुक ऐकू शकता.

ईवाचक आणि इतर डिव्हाइसेस

Kobo eReaders सारख्या ई-इंक डिव्‍हाइसवर वाचण्‍यासाठी, तुम्ही एखादी फाइल डाउनलोड करून ती तुमच्‍या डिव्‍हाइसवर ट्रान्सफर करणे आवश्यक आहे. सपोर्ट असलेल्या eReaders वर फाइल ट्रान्सफर करण्यासाठी, मदत केंद्र मधील तपशीलवार सूचना फॉलो करा.

बेकायदेशीर आशयाची तक्रार करा