|Eingestellt in Kategorie:
Ähnlichen Artikel verkaufen?

Software-Synthese aus Datenflussdiagrammen von Shuvra S. Bhattacharyya (englisch) Har

Artikelzustand:
Neu
3 verfügbar
Preis:
US $124,71
Ca.CHF 110,32
Versand:
Kostenlos Economy Shipping. Weitere Detailsfür Versand
Standort: Fairfield, Ohio, USA
Lieferung:
Lieferung zwischen Fr, 5. Jul und Di, 16. Jul nach 43230 bei heutigem Zahlungseingang
Liefertermine - wird in neuem Fenster oder Tab geöffnet berücksichtigen die Bearbeitungszeit des Verkäufers, die PLZ des Artikelstandorts und des Zielorts sowie den Annahmezeitpunkt und sind abhängig vom gewählten Versandservice und dem ZahlungseingangZahlungseingang - wird ein neuem Fenster oder Tab geöffnet. Insbesondere während saisonaler Spitzenzeiten können die Lieferzeiten abweichen.
Rücknahmen:
30 Tage Rückgabe. Käufer zahlt Rückversand. Weitere Details- Informationen zu Rückgaben
Zahlungen:
     

Sicher einkaufen

eBay-Käuferschutz
Geld zurück, wenn etwas mit diesem Artikel nicht stimmt. 

Angaben zum Verkäufer

Angemeldet als gewerblicher Verkäufer
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:386700025347
Zuletzt aktualisiert am 19. Mai. 2024 14:25:21 MESZAlle Änderungen ansehenAlle Änderungen ansehen

Artikelmerkmale

Artikelzustand
Neu: Neues, ungelesenes, ungebrauchtes Buch in makellosem Zustand ohne fehlende oder beschädigte ...
ISBN-13
9780792397229
Book Title
Software Synthesis from Dataflow Graphs
ISBN
9780792397229
Subject Area
Computers, Technology & Engineering
Publication Name
Software Synthesis from Dataflow Graphs
Item Length
9.2 in
Publisher
Springer
Subject
Software Development & Engineering / General, Signals & Signal Processing, Cad-Cam, Electrical, Data Processing
Publication Year
1996
Series
The Springer International Series in Engineering and Computer Science Ser.
Type
Textbook
Format
Hardcover
Language
English
Author
Praveen K. Murthy, Shuvra S. Bhattacharyya, Edward A. Lee
Item Width
6.1 in
Item Weight
36.7 Oz
Number of Pages
Xii, 190 Pages

Über dieses Produkt

Product Information

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.

Product Identifiers

Publisher
Springer
ISBN-10
0792397223
ISBN-13
9780792397229
eBay Product ID (ePID)
313207

Product Key Features

Author
Praveen K. Murthy, Shuvra S. Bhattacharyya, Edward A. Lee
Publication Name
Software Synthesis from Dataflow Graphs
Format
Hardcover
Language
English
Subject
Software Development & Engineering / General, Signals & Signal Processing, Cad-Cam, Electrical, Data Processing
Publication Year
1996
Series
The Springer International Series in Engineering and Computer Science Ser.
Type
Textbook
Subject Area
Computers, Technology & Engineering
Number of Pages
Xii, 190 Pages

Dimensions

Item Length
9.2 in
Item Width
6.1 in
Item Weight
36.7 Oz

Additional Product Features

LCCN
96-013624
Intended Audience
Scholarly & Professional
Series Volume Number
360
Number of Volumes
1 Vol.
Lc Classification Number
Tk5102.9
Table of Content
1 Introduction.- 1.1 Block Diagram Environments.- 1.2 Modularity and Code Generation.- 1.3 Dataflow.- 1.4 Synchronous Dataflow.- 1.5 Generalizations to the SDF model.- 1.6 Compilation Model.- 1.7 Constructing Efficient Periodic Schedules.- 1.8 Related Work.- 2 Terminology and Notation.- 2.1 Graph Concepts.- 2.2 Computational Complexity.- 3 Synchronous dataflow.- 3.1 Computing the Repetitions Vector.- 3.2 Constructing a Valid Schedule.- 3.3 Scheduling to Minimize Buffer Usage.- 4 Looped Schedules.- 4.1 Looped Schedule Terminology and Notation.- 4.2 Buffering Model.- 4.3 Clustering SDF Subgraphs.- 4.4 Factoring Schedule Loops.- 4.5 Reduced Single Appearance Schedules.- 4.6 Subindependence.- 4.7 Computation Graphs.- 5 Loose Interdependence Algorithms.- 5.1 Loose Interdependence Algorithms.- 5.2 Modem Example.- 5.3 Clustering in a Loose Interdependence Algorithm.- 5.4 Relation to Vectorization.- 6 Joint Code and Data Minimization.- 6.1 R-Schedules.- 6.2 The Buffer Memory Lower Bound for Single Appearance Schedules.- 6.3 Dynamic Programming Post Optimization.- 6.4 Recursive Partitioning by Minimum Cuts (RPMC).- 6.5 Non-uniform Filterbank Example.- 7 Pairwise Grouping of Adjacent Nodes.- 7.1 Proper Clustering.- 7.2 The Optimality of APGAN for a Class of Graphs.- 7.3 Examples.- 8 Experiments.- 9 Open Issues.- 9.1 Tightly Interdependent Graphs.- 9.2 Buffering.- 9.3 Parallel Computation.
Copyright Date
1996
Dewey Decimal
621.382/2/0285512
Dewey Edition
20
Illustrated
Yes

Artikelbeschreibung des Verkäufers

grandeagleretail

grandeagleretail

98,3% positive Bewertungen
2.7 Mio. Artikel verkauft
Shop besuchenKontakt
Antwortet meist innerhalb 24 Stunden

Detaillierte Verkäuferbewertungen

Durchschnitt in den letzten 12 Monaten

Genaue Beschreibung
4.9
Angemessene Versandkosten
5.0
Lieferzeit
4.9
Kommunikation
4.9
Angemeldet als gewerblicher Verkäufer

Verkäuferbewertungen (1'025'315)

_***m (228)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
Nice hardcover book in new condition. I am happy with this purchase.
c***a (741)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
Outstanding Job. Love The Book. Half Way Through Already.Thank You Very Much
d***i (150)- Bewertung vom Käufer.
Letzter Monat
Bestätigter Kauf
Package arrived early and was in excellent condition ! A great book by a great author at a great price !!! Thank you !!