A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Monotonicity and run-time scheduling
2009
Proceedings of the seventh ACM international conference on Embedded software - EMSOFT '09
Modern embedded multi-processors can execute several streamprocessing applications concurrently. Typically, these applications are partitioned into tasks that communicate over buffers together forming a task graph. The fact that these applications are started and stopped by the user combined with the knowledge that not all applications are necessarily completely characterised makes it attractive to use run-time scheduling. We define and characterise a class of budget schedulers that by
doi:10.1145/1629335.1629359
dblp:conf/emsoft/WiggersBS09
fatcat:pmj2dpdbzfgb7niv3kwggzkupq