High-Performance Embedded Computing

202 Chapter 3 Programs

A is not in a tightly interdependent subgraph and so could appear only once in a

schedule. But if we cluster A and B together, then we can no longer find a sched-

ule with only one appearance of A—the shortest schedule for the new graph is

ABC(2D)AB.

We can use this recursive property of a single-appearance schedule to sched-

ule an SDF. The scheduling algorithm recursively decomposes a graph into sub-

independent pieces to determine its schedule.

buffer

management

in SDFs

Bhattacharyya and Lee [Bha94b] developed scheduling methods that can be

used to implement efficient buffering schemes. They use the common code

space set graph ...