Monotonicity and run-time scheduling

M. Wiggers, M.J.G. Bekooij, G.J.M. Smit

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

31 Citations (Scopus)
340 Downloads (Pure)


Modern embedded multi-processors can execute several stream-processing 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 construction bound the interference from other applications. Furthermore, we will show that the worst-case effects of these schedulers can be included in dataflow process networks. The execution of the resulting dataflow process network is shown to result in tight and conservative bounds on the end-to-end temporal behaviour of the execution of the task graph on a cycle-true simulator. Given that the inter-task synchronisation of the application allows for a dataflow model that is functionally deterministic, this enables exploration of various buffer capacities and scheduler settings at a high level of abstraction.
Original languageEnglish
Title of host publicationProceedings of the 7th ACM International Conference on Embedded Software (EMSOFT '09), 12-16 October 2009, Grenoble, France
EditorsS. Chakraborto, N. Halbwachs
PublisherAssociation for Computing Machinery, Inc
ISBN (Print)978-1-60558-627-4
Publication statusPublished - 2009
Eventconference; EMSOFT'09, Grenoble, France; 2009-10-12; 2009-10-16 -
Duration: 12 Oct 200916 Oct 2009


Conferenceconference; EMSOFT'09, Grenoble, France; 2009-10-12; 2009-10-16
OtherEMSOFT'09, Grenoble, France


Dive into the research topics of 'Monotonicity and run-time scheduling'. Together they form a unique fingerprint.

Cite this