Jad Khatib
ABSTRACT
Mixed applications that gather real-time tasks and best effort jobs require a research effort in order to be effectively modeled and executed. Therefore, in this study we define a general and intuitive communication model between multi-periodic real-time tasks. We first demonstrate that the communications between real-time tasks can be directly expressed as a "Synchronous Data-flow Graph". This modeling allows precise definition of the system latency. Accordingly, we develop an exact evaluation method to calculate the worst case latency of a system from a given input to a connected outcome. Then, we frame this value using two algorithms that compute its upper and lower bounds. Finally, we show that these bounds can be computed using a polynomial amount of computation time, while the time required to compute the exact value increases linearly according to the average repetition factor. Furthermore, the gap between the exact result and its upper (resp. lower) bound is evaluated between 10 and 15 % (resp. 20 and 30%).
- M. Bamakhrama, J. T. Zhai, H. Nikolov, and T. Stefanov. A methodology for automated design of hard-real-time embedded streaming systems. In W. Rosenstiel and L. Thiele, editors, DATE, pages 941--946. IEEE, 2012. Google Scholar
Digital Library
- G. Bilsen, M. Engels, R. Lauwereins, and J. A. Peperstraete. Cyclo-static data flow. In Acoustics, Speech, and Signal Processing, 1995. ICASSP-95., 1995 International Conference on, volume 5, pages 3255--3258 vol.5, May 1995.Google Scholar
- B. Bodin, Y. Lesparre, J.-M. Delosme, and A. Munier-Kordon. Fast and efficient dataflow graph generation. In Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems, pages 40--49. ACM, 2014. Google ScholarDigital Library
- A. Bouakaz, J. P. Talpin, and J. Vitek. Affine data-flow graphs for the synthesis of hard real-time applications. In Application of Concurrency to System Design (ACSD), 2012 12th International Conference on, pages 183--192, June 2012. Google ScholarDigital Library
- U. Brandes. A faster algorithm for betweenness centrality*. Journal of mathematical sociology, 25(2):163--177, 2001.Google Scholar
- J. Forget, F. Boniol, D. Lesens, and C. Pagetti. A Multi-Periodic Synchronous Data-Flow Language. In HASE, pages 251--260. IEEE Computer Society, 2008. Google ScholarDigital Library
- S. Goddard. Analyzing the real-time properties of a dataflow execution paradigm using a synthetic aperture radar application. In Real-Time Technology and Applications Symposium, 1997. Proceedings., Third IEEE, pages 60--71. IEEE, 1997. Google ScholarDigital Library
- K. Goossens, A. Azevedo, K. Chandrasekar, M. D. Gomony, S. Goossens, M. Koedam, Y. Li, D. Mirzoyan, A. Molnos, A. B. Nejad, A. Nelson, and S. Sinha. Virtual Execution Platforms for Mixed-time-criticality Systems: The CompSOC Architecture and Design Flow. SIGBED Rev., 10(3):23--34, Oct. 2013. Google ScholarDigital Library
- T. Goubier, R. Sirdey, S. Louise, and V. David. ∑C: A Programming Model and Language for Embedded Manycores. In Y. Xiang, A. Cuzzocrea, M. Hobbs, and W. Zhou, editors, ICA3PP (1), volume 7016 of Lecture Notes in Computer Science, pages 385--394. Springer, 2011. Google ScholarDigital Library
- N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous data flow programming language LUSTRE. Proceedings of the IEEE, 79(9):1305--1320, Sep 1991.Google ScholarCross Ref
- E. Lee and D. Messerschmitt. Synchronous data flow. Proceedings of the IEEE, 75(9):1235--1245, Sept 1987.Google ScholarCross Ref
- C. L. Liu and J. W. Layland. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. J. ACM, 20(1):46--61, Jan. 1973. Google ScholarDigital Library
- L. Mandel, F. Plateau, and M. Pouzet. Lucy-n: a n-Synchronous Extension of Lustre. In C. Bolduc, J. Desharnais, and B. Ktari, editors, MPC, volume 6120 of Lecture Notes in Computer Science, pages 288--309. Springer, 2010. Google ScholarDigital Library
- O. Marchetti and A. M. Kordon. A sufficient condition for the liveness of weighted event graphs. European Journal of Operational Research, 197(2):532--540, 2009.Google ScholarCross Ref
- O. Marchetti and A. Munier-Kordon. Cyclic Scheduling for the Synthesis of Embedded Systems, chapter 6, pages 129--154. Chapman and Hall/CRC Computational Science, 2009.Google Scholar
- O. M. Moreira and M. J. Bekooij. Self-timed scheduling analysis for real-time applications. EURASIP Journal on Advances in Signal Processing, 2007(1):1--14, 2007.Google ScholarCross Ref
- A. Munier. Optimal asymptotic behavior of a generalized timed event graph: application to an assembly system. APII, 27:487--487, 1993.Google Scholar
- W. Thies, M. Karczmarek, and S. P. Amarasinghe. StreamIt: A Language for Streaming Applications. In R. N. Horspool, editor, Proceedings of the 11th International Conference on Compiler Construction, CC'02, pages 179--196, London, UK, UK, 2002. Springer-Verlag. Google ScholarDigital Library
- W. Thies, J. Lin, and S. Amarasinghe. Phased computation graphs in the polyhedral model, 2002.Google Scholar
- L. Vlacic, M. Parent, and F. Harashima. Intelligent vehicle technologies: theory and applications. Butterworth-Heinemann, 2001.Google Scholar
- R. Wyss, F. Boniol, C. Pagetti, and J. Forget. End-to-end latency computation in a multi-periodic design. In S. Y. Shin and J. C. Maldonado, editors, SAC, pages 1682--1687. ACM, 2013. Google ScholarDigital Library
Recommendations
Worst-Case Response Time Analysis of a Synchronous Dataflow Graph in a Multiprocessor System with Real-Time Tasks
Special Section of IDEA: Integrating Dataflow, Embedded Computing, and ArchitectureIn this article, we propose a novel technique that estimates a tight upper bound of the worst-case response time (WCRT) of a synchronous dataflow (SDF) graph when the SDF graph shares processors with other real-time tasks. When an SDF graph is executed ...
Real-Time Chain-Structured Synchronous Dataflow: Latency and Data Memory Requirement Formal Determination
ICAS '09: Proceedings of the 2009 Fifth International Conference on Autonomic and Autonomous SystemsWe consider in this paper a Synchronous DataFlow (SDF) scheduling problem in the context of a multimedia real-time application. A SDF is in our context a chain of non-preemptive processing tasks in charge of the treatment of multimedia data blocks, ...
Uniprocessor scheduling of real-time synchronous dataflow tasks
The synchronous dataflow graph (SDFG) model is widely used today for modeling real-time applications in safety-critical application domains. Schedulability analysis techniques that are well understood within the real-time scheduling community are ...
Comments