Monotonicity and Run-Time Scheduling [poster]

Share/Save/Bookmark

Wiggers, Maarten and Bekooij, Marco and Smit, Gerard (2010) Monotonicity and Run-Time Scheduling [poster]. In: Berkeley EECS Annual Research Symposium, BEARS 2010, 11 Feb 2010, Berkeley, CA, USA.

open access
[img] PDF
425kB
Abstract: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.
Item Type:Conference or Workshop Item
Copyright:© 2010 Center for Hybrid and Embedded Software Systems, Chess
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/75579
Official URL:http://chess.eecs.berkeley.edu/pubs/659.html
Conference URL:http://www.eecs.berkeley.edu/IPRO/BEARS/2010/
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page