Abstract | ||
---|---|---|
Flexible and adaptive behavior is seen as one of the key characteristics of next generation hard real-time systems. Within
the context of fixed priority pre-emptive scheduling, existing approaches deal with optional components and provide kernel
mechanisms to schedule effectively such components when spare processor capacity is available. This paper describes a framework
that provides a task programming model with optional components, and the appropriate mechanisms for supporting it, by using
the main results of existing research in computing spare processor capacity. The paper shows how these ideas can be adapted
for being used from an Ada application. The concurrency and real-time programming features of Ada allow an elegant and efficient
implementation of a model where hard real-time tasks, optional unbounded components and optional firm tasks coexist.
|
Year | DOI | Venue |
---|---|---|
1998 | 10.1007/BFb0054998 | Ada-Europe |
Keywords | Field | DocType |
optional components,programming hard real-time systems,adaptive behavior,real time,programming model | Kernel (linear algebra),Programming language,Spare part,Programming paradigm,Scheduling (computing),Computer science,Concurrency,Real-time operating system,Real-time computing,Earliest deadline first scheduling,Software development,Distributed computing | Conference |
Volume | ISSN | ISBN |
1411 | 0302-9743 | 3-540-64536-5 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Augustín Espinosa | 1 | 4 | 1.25 |
Vicente Julián | 2 | 546 | 87.40 |
Carlos Carrascosa | 3 | 170 | 26.72 |
Andrés Terrasa | 4 | 44 | 9.51 |
Ana García-fornes | 5 | 349 | 44.07 |