Computing periodic request functions to speed-up the analysis of non-cyclic task models (Q495917)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing periodic request functions to speed-up the analysis of non-cyclic task models |
scientific article; zbMATH DE number 6482717
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing periodic request functions to speed-up the analysis of non-cyclic task models |
scientific article; zbMATH DE number 6482717 |
Statements
Computing periodic request functions to speed-up the analysis of non-cyclic task models (English)
0 references
16 September 2015
0 references
real-time schedulability
0 references
task graph model
0 references
max-plus algebra
0 references
request/demand bound functions
0 references
0.8473731
0 references
0.84598327
0 references
0.83971554
0 references
0.8342727
0 references
0.83081996
0 references
0.82539946
0 references
0.8218898
0 references
