University of Leicester
Browse
AKG_safecomp2008_TTSA2_v20.pdf (210.44 kB)

Automating the processes of selecting an appropriate scheduling algorithm and configuring the scheduler implementation for time-triggered embedded systems

Download (210.44 kB)
conference contribution
posted on 2009-03-19, 11:22 authored by Ayman K. Gendy, Michael J. Pont
Predictable system behaviour is a necessary (but not sufficient) condition when creating safety-critical and safety-related embedded systems. At the heart of such systems there is usually a form of scheduler: the use of time-triggered schedulers is of particular concern in this paper. It has been demonstrated in previous studies that the problem of determining the task parameters for such a scheduler is NP-hard. We have previously described an algorithm (“TTSA1”) which is intended to address this problem. This paper describes an extended version of this algorithm (“TTSA2”) which employs task segmentation to increase schedulability. We show that the TTSA2 algorithm is highly efficient when compared with alternative “branch and bound” search schemes.

History

Citation

Lecture Notes In Computer Science, 2008, 5219, pp. 440 - 453.

Published in

Lecture Notes In Computer Science

Publisher

Springer Verlag.

issn

0302-9743

Available date

2009-03-19

Publisher version

http://link.springer.com/chapter/10.1007/978-3-540-87698-4_36

Notes

This is the author’s final draft of the conference paper given at Proceedings of the 27th international conference on Computer Safety, Reliability, and Security 2008, published as Lecture Notes In Computer Science, 2008, 5219, pp. 440 - 453. The final published version is available at http://www.springerlink.com/home, Doi: 10.1007/978-3-540-87698-4_36.

Language

en

Usage metrics

    University of Leicester Publications

    Categories

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC