Optimizing performance analysis for synchronous dataflow graphs with shared resources

Authors:
Daniel Thiele;Rolf Ernst
Affiliations:
Technische Universität Braunschweig, Germany;Technische Universität Braunschweig, Germany
Venue:
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2012

Citing 5
Cited 0

Embedded Multiprocessors: Scheduling and Synchronization

Embedded Multiprocessors: Scheduling and Synchronization
Performance analysis of complex systems by integration of dataflow graphs and compositional performance analysis

Proceedings of the conference on Design, automation and test in Europe
Improved response time analysis of tasks scheduled under preemptive Round-Robin

CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication

RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
An efficient technique for analysis of minimal buffer requirements of synchronous dataflow graphs with model checking

CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Contemporary embedded systems, which process streaming data such as signal, audio, or video data, are an increasingly important part of our 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 dataflow (SDF) semantics are frequently used to model these systems. In this paper, we present a method to integrate resource sharing into SDF graphs. Using these graphs and a throughput constraint, we will derive deadlines for resource accesses and the amount of memory required for an implementation. Then we derive the resource load directly from the SDF description, and perform a formal schedulability analysis to check if the original timing constraints are still met. Finally, we perform an evaluation of our approach using an image processing application and present our results.