Preemptive LCFS scheduling in hard real-time applications (Q4030468)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 147528
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive LCFS scheduling in hard real-time applications |
scientific article; zbMATH DE number 147528 |
Statements
Preemptive LCFS scheduling in hard real-time applications (English)
0 references
1 April 1993
0 references
probability generating functions
0 references
singularity analysis
0 references
asymptotics
0 references
last come first serve
0 references
discrete time single server system
0 references
real-time behaviour
0 references
preemptive LCFS task scheduling
0 references
0.9128745198249816
0 references
0.9110262393951416
0 references
0.878508448600769
0 references
0.8766358494758606
0 references
0.8331008553504944
0 references
