Optimizing Performance Analysis for Synchronous Dataflow Graphs with Shared Resources
Contemporary embedded systems, which process streaming data such as signal, audio, or video data, are an increasingly important part of the authors' lives. Shared resources (e.g. memories) help to reduce the chip area and power consumption of these systems, saving costs in high volume consumer products. Resource sharing, however, introduces new timing interdependencies between system components, which must be analyzed to verify that the initial timing requirements of the application domain are still met. Graphs with Synchronous Data-Flow (SDF) semantics are frequently used to model these systems.