Publication: Research - peer-review › Conference paper
words20110_submission_1.pdf, 1 MB, application/pdf
In many cases, the execution platform puts firm resource limitations on available memory and speed of computations that must be taken into consideration for the validation of the system.
In this paper, we focus on code synthesis from the model, and we show how specified timing requirements are preserved and translated into scheduling information. In particular, we present how ceiling levels for Stack Resources Policy (SRP) scheduling and analysis can be extracted from the model. Additionally, to support schedulability analysis, we detail algorithms that for a CRO model derives periods (minimum inter-arrival times) and offsets of tasks/jobs. Moreover, the design of a micro-kernel supporting cooperative hardware- and software-scheduling of CRO based systems under Deadline Monotonic SRP is presented.
|Publication date||Jun 2011|
|Number of pages||8|
|Workshop||International Workshop on Dependable and Secure Industrial and Embedded Systems|
|Period||04/06/11 → 04/06/11|
Event (Conference etc)
International Workshop on Dependable and Secure Industrial and Embedded Systems
Jun. 04 2011 - Jun. 04 2011Västerås, Sweden
Event (Conference etc): Workshop