Titlebook: Software Synthesis from Dataflow Graphs; Shuvra S. Battacharyya,Praveen K. Murthy,Edward A. Book 1996 Kluwer Academic Publishers 1996 Over

Constrain

残忍

Joint Code and Data Minimization,ngle appearance schedules. Thus, given the model of buffer implementation defined in Section 4.2, we wish to construct a software implementation that minimizes the data memory requirement over all minimum code-size implementations. Even for chain-structured SDF graphs, the number of distinct valid s

遗传

欲望

Lumbar-Spine

LOPE

sperse

Experiments,ained 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.

猛然一拉

贫困

Pairwise Grouping of Adjacent Nodes,all clusterable adjacent pairs {.}. Recall from Section 4.3 that ρ(.) can be viewed as the number of times a minimal periodic schedule for the subset of actors . is invoked in the given SDF graph, and thus, we see that the PGAN technique repeatedly clusters adjacent pairs whose associated subgraphs are invoked most frequently in a valid schedule.

墙壁

978-1-4612-8601-1Kluwer Academic Publishers 1996