The equivalence between processor sharing and service in random order. (Q1413911): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Networks of queues and the method of stages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open, Closed, and Mixed Networks of Queues with Different Classes of Customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3045036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Waiting Time Distributions for Processor-Sharing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiple phase service network with generalized processor sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On processor sharing and random service / rank
 
Normal rank
Property / cites work
 
Property / cites work: The waiting time distribution for the random order service \(M/M/1\) queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gi/m/1 processor-sharing queue and its heavy traffic analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3855869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of A time‐shared processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-shared Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Response-Time Distribution for a Processor-Sharing System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4486410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NOTE ON THE GI/GI/1 QUEUE WITH LCFS-PR OBSERVED AT ARBITRARY TIMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sojourn-time distribution in the <i>M/G</i>/1 queue by processor sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sojourn time in the <i>GI/M/</i>1 queue by processor sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the <i>M</i>/<i>G</i>/1 Queue Under Round-Robin Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Distribution of Queuing Network States at Input and Output Instants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processor-sharing queues: Some progress in analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical problems in the theory of processor-sharing queueing systems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(03)00006-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053793452 / rank
 
Normal rank

Latest revision as of 10:28, 30 July 2024

scientific article
Language Label Description Also known as
English
The equivalence between processor sharing and service in random order.
scientific article

    Statements

    The equivalence between processor sharing and service in random order. (English)
    0 references
    17 November 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers