Extension of scheduling algorithms in case of conditional or parametric synchronisation relationships

Author

Babau, J. -Ph ; Cottet, F.

Author_Institution

LISI/ENSMA, Futuroscope, France

fYear

1996

fDate

12-14 Jun 1996

Firstpage

64

Lastpage

69

Abstract

A hard real time system is composed of a set of tasks with hard deadlines. Real time scheduling algorithms are used to evaluate the priorities of the tasks and then to drive the validation. To realise the priority mapping, it is necessary to obtain a set of temporal and relational characteristics. We compute precedence constraints in case of conditional and parametric synchronisation relationships. Then, we apply the scheduling algorithms and we carry out the validation based on realistic execution modes of the tasks

Keywords

program verification; real-time systems; resource allocation; scheduling; synchronisation; conditional synchronisation relationships; hard deadlines; hard real time system; parametric synchronisation relationships; precedence constraints; priority mapping; real time scheduling algorithms; relational characteristics; task deadlines; task priorities; temporal characteristics; validation; Access protocols; Algorithm design and analysis; Application software; Computer aided software engineering; Computer languages; Kernel; Processor scheduling; Real time systems; Safety; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems, 1996., Proceedings of the Eighth Euromicro Workshop on

Conference_Location

L´Aquila

ISSN

1068-3070

Print_ISBN

0-8186-7496-2

Type

conf

DOI

10.1109/EMWRTS.1996.557797

Filename

557797