Timing analysis of First-Come First-Served scheduled interval-timed Directed Acyclic Graphs

Autor: R. M. W. Frijns, S. Adyanthaya, S. Stuijk, J. P. M. Voeten, M. C. W. Geilen, R. R. H. Schiffelers, H. Corporaal

Publikováno v: 17th Design, Automation and Test in Europe, DATE 2014, 24 March 2014 through 28 March 2014, Dresden
Proceedings of the design, automation and test in Europe(DATE) 24-28 March 2014, Dresden, Germany, 1-6
STARTPAGE=1;ENDPAGE=6;TITLE=Proceedings of the design, automation and test in Europe(DATE) 24-28 March 2014, Dresden, Germany

Analyzing worst-case application timing for systems with shared resources is difficult, especially when non-monotonic arbitration policies like First-Come-First-Served (FCFS) scheduling are used in combination with varying task execution times. Analy

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb71d282ee4df48e221395f21a3f6ef6
http://resolver.tudelft.nl/uuid:41fe59bc-5189-4e73-9663-7acb525b6221