Can I read On the Improved Hard Real-Time Scheduling of Cyclo-Static Dataflow on EtoBox?

On the Improved Hard Real-Time Scheduling of Cyclo-Static Dataflow by Jelena Spasic; Di Liu; Emanuele Cannella; Todor Stefanov is a Computer Science article available to read on EtoBox.

What is On the Improved Hard Real-Time Scheduling of Cyclo-Static Dataflow about?

Recently, it has been shown that the hard real-time scheduling theory can be applied to streaming applications modeled as acyclic Cyclo-Static Dataflow (CSDF) graphs. However, this recent approach is not always efficient in terms of throughput and processor utilization. Therefore, in this article, we propose an improved hard real-time scheduling approach to schedule streaming applications modeled as acyclic CSDF graphs on a Multiprocessor System-on-Chip (MPSoC) platform. The proposed approach converts each actor in a CSDF graph to a set of real-time periodic tasks. The conversion enables application of many hard real-time scheduling algorithms that offer fast calculation of the required number of processors for scheduling the tasks. In addition, we propose a method to reduce the graph latency when the converted tasks are scheduled as real-time periodic tasks. We evaluate the performance and time complexity of our approach in comparison to several existing scheduling approaches. Experiments on a set of real-life streaming applications demonstrate that our approach (1) results in systems with higher throughput and better processor utilization in comparison to the existing hard real-t

Who reads On the Improved Hard Real-Time Scheduling of Cyclo-Static Dataflow?

Author

Jelena Spasic; Di Liu; Emanuele Cannella; Todor Stefanov

Publisher

ACM

Published

2016

Language

EN

Field

Computer Science (Physical Sciences)