University of Twente Student Theses
A Tick Based Fixed Priority Scheduler Suitable for Dataflow Analysis of Task Graphs
Vries, J.J. de (2016) A Tick Based Fixed Priority Scheduler Suitable for Dataflow Analysis of Task Graphs.
|
PDF
240kB |
| Abstract: | Task graphs of real-time stream processing applications can be modeled using dataflow graphs. Dataflow analysis can then be used to determine maximum finish times of the tasks, including delays due to Fixed Priority Preemptive (FPP) scheduling. However, acquires and releases of con- tainers happen atomically in the dataflow model, which can- not be guaranteed by existing Real-Time Operating Sys- tems (RTOSes). In this paper we propose a tick-based FPP scheduler for which maximum finish times can be derived using an ex- tended dataflow model. For this specific scheduler, it can be shown that the finish times are pessimistic, even if tasks acquire and release non-atomically. Results obtained using an event-driven simulator confirm that the finish times derived for a non-tick based FPP sched- uler are optimistic, whereas the finish times derived for the proposed scheduler are pessimistic. |
| Item Type: | Essay (Master) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 54 computer science |
| Programme: | Embedded Systems MSc (60331) |
| Link to this item: | https://purl.utwente.nl/essays/71304 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page