Abstract
Table 8.1 shows the results of applying GDPPO to the schedules generated by APGAN and RPMC on several practical SDF systems. The columns labeled “% Impr.” show the percentage of buffer memory reduction obtained by GDPPO. The QMF tree filter banks fall into a class of graphs for which APGAN is guaranteed to produce optimal results (see Chapter 7), and thus there is no room for GDPPO to produce improvement when APGAN is applied to these two examples. Overall, GDPPO produces an improvement in 11 out of the 14 heuristic/application combinations. A “significant” (greater than 5%) improvement is obtained in 9 of the 14 combinations; the mean improvement over all 14 combinations is 9.9%; and from the CD-DAT and DAT-CD examples, we see that it is possible to obtain very large reductions in the buffer memory requirement with GDPPO.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Battacharyya, S.S., Murthy, P.K., Lee, E.A. (1996). Experiments. In: Software Synthesis from Dataflow Graphs. The Kluwer International Series in Engineering and Computer Science, vol 360. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1389-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1389-2_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8601-1
Online ISBN: 978-1-4613-1389-2
eBook Packages: Springer Book Archive