Minimality of EDF networks with resource sharing (Q343806): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59473700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of earliest-due-date, first-served queueing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fluid limits for networks with bandwidth sharing and general document size distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Open Queueing Network with Asymptotically Stable Fluid Model and Unconventional Heavy Traffic Behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliest-deadline-first service in heavy-traffic acyclic networks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy traffic analysis for EDF queues with reneging / 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: Bandwidth sharing and admission control for elastic traffic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135799 / rank
 
Normal rank

Latest revision as of 00:54, 13 July 2024

scientific article
Language Label Description Also known as
English
Minimality of EDF networks with resource sharing
scientific article

    Statements

    Minimality of EDF networks with resource sharing (English)
    0 references
    0 references
    29 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    queueing
    0 references
    resource sharing
    0 references
    partial ordering
    0 references
    minimality
    0 references
    0 references
    0 references