Firew Siyoum
ABSTRACT
Embedded streaming applications require design-time temporal analysis to verify real-time constraints such as throughput and latency. In this paper, we introduce a new analytical technique to compute temporal bounds of streaming applications mapped onto a shared multiprocessor platform. We use an expressively rich application model that supports adaptive applications where graph structure, execution times and data rates may change dynamically. The analysis technique combines symbolic simulation in (max, +) algebra with worst-case resource availability curves. It further enables a tighter performance guarantee by improving the WCRTs of service requests that arrive in the same busy time. Evaluation on real-life application graphs shows that the technique is tens of times faster than the state-of-the-art and enables tighter throughput guarantees, up to a factor of 4, compared to the typical worst-case analysis.
- F. Baccelli et. al. Synchronization and Linearity: An Algebra for Discrete Event Systems. 1993.Google Scholar
- S. Chakraborty et. al. A general framework for analysing system properties in embedded system designs. In DATE, 2003. Google ScholarDigital Library
- M. Damavandpeyma et. al. Modeling static-order schedules in synchronous dataflow graphs. In DATE, 2012. Google ScholarDigital Library
- A. Dasdan. Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Trans. Des. Autom. Electron. Syst., 2004. Google ScholarDigital Library
- M. Geilen and S. Stuijk. Worst-case performance analysis of synchronous dataflow scenarios. In CODES/ISSS, 2010. Google ScholarDigital Library
- A. Ghamarian et. al. Throughput analysis of synchronous data flow graphs. In ACSD, 2006. Google ScholarDigital Library
- R. Henia et. al. System level performance analysis-the SymTA/S approach. Computers and Digital Techniques, IEEE Proc., 2005.Google Scholar
- J. Kim et. al. A novel analytical method for worst case response time estimation of distributed embedded systems. In DAC, 2013. Google ScholarDigital Library
- E. Lee and D. Messerschmitt. Synchronous dataflow. Proceedings of IEEE, 1987.Google Scholar
- A. Lele et. al. A new data flow analysis model for TDM. In EMSOFT, 2012. Google ScholarDigital Library
- O. Moreira. Temporal Analysis and Scheduling of Hard-Real-Time Radios running on a Multi-Processor. PhD thesis, Eindhoven University of Technology, 2011.Google Scholar
- S. Schliecker et. al. Providing accurate event models for the analysis of heterogeneous multiprocessor systems. In CODES+ISSS, 2008. Google ScholarDigital Library
- S. Stuijk et. al. SDF3: SDF For Free. In ACSD, 2006. Google ScholarDigital Library
- L. Thiele and N. Stoimenov. Modular performance analysis of cyclic dataflow graphs. EMSOFT, 2009. Google ScholarDigital Library
- K. W. Tindell et. al. An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Syst., 1994. Google ScholarDigital Library
- M. H. Wiggers et al. Modelling run-time arbitration by latency-rate servers in dataflow graphs. In SCOPES, 2007. Google ScholarDigital Library
- H. Wu et. al. A Model-Based Schedule Representation for Heterogeneous Mapping of Dataflow Graphs. IPDPSW, 2011. Google ScholarDigital Library
Recommendations
End-to-End Latency Analysis of Dataflow Scenarios Mapped Onto Shared Heterogeneous Resources
The design of embedded wireless and multimedia applications requires temporal analysis to verify if real-time constraints such as throughput and latency are met. This paper presents a design-time analytical approach to derive a conservative upper bound to ...
Performance evaluation of HEVC RCL applications mapped onto NoC-based embedded platforms
SBCCI '19: Proceedings of the 32nd Symposium on Integrated Circuits and Systems DesignToday, several applications running into embedded systems have to fulfill soft or hard timing constraints. Video applications, like the modern High Efficiency Video Coding (HEVC), e.g., most often have soft real-time constraints. However, in specific ...
Optimizing performance analysis for synchronous dataflow graphs with shared resources
DATE '12: Proceedings of the Conference on Design, Automation and Test in EuropeContemporary 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, ...
Comments