Partitioned EDF scheduling: a closer look (Q2251383): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11241-013-9186-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993893662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proportionate progress: A notion of fairness in resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Utilization bounds for EDF scheduling on real-time multiprocessor systems / rank
 
Normal rank

Latest revision as of 17:40, 8 July 2024

scientific article
Language Label Description Also known as
English
Partitioned EDF scheduling: a closer look
scientific article

    Statements

    Partitioned EDF scheduling: a closer look (English)
    0 references
    0 references
    14 July 2014
    0 references
    partitioned scheduling
    0 references
    implicit-deadline sporadic task systems
    0 references
    earliest deadline first
    0 references
    speedup bounds
    0 references

    Identifiers