A survey on discriminatory processor sharing (Q2494560): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56753260, #quickstatements; #temporary_batch_1711486624475
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Batch arrival processor-sharing with application to multi-level processor-sharing scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insensitive bandwidth sharing in data networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stochastic bounds for monotonic processor sharing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sojourn time asymptotics in processor-sharing queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Waiting Time Performance Realizable by Single-Server Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing a Processor Among Many Job Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sample-path conservation laws, with applications to scheduling queues and fluid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: To queue or not to queue: equilibrium behavior in queueing systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical analysis of the cumulus pricing scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the transient behavior of the processor sharing queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3855869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conservation law for a wide class of queueing disciplines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-shared Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The processor‐sharing queueing model for time‐shared systems with bulk arrivals / 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: Complete parameterized families of job scheduling strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic analysis of a large closed queueing network with discriminatory processor sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Solutions of <i>M</i>/<i>G</i>/1 Processor-Sharing Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem and related results for the discriminatory processor sharing queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queue-Length Distribution for the Discriminatory Processor-Sharing Queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized processor sharing queues with heterogeneous traffic classes / 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 / cites work
 
Property / cites work: Sojourn time asymptotics in the \(M/G/1\) processor sharing queue / rank
 
Normal rank

Revision as of 16:33, 24 June 2024

scientific article
Language Label Description Also known as
English
A survey on discriminatory processor sharing
scientific article

    Statements

    A survey on discriminatory processor sharing (English)
    0 references
    0 references
    0 references
    28 June 2006
    0 references
    This paper is a summarizing article about the Discriminatory Processor Sharing (DPS) model. The characteristics of the DPS model is that all jobs present in the system are served simultaneously at rates controlled by a vector of weights \(\{g_{k}>0,\;k=1,2,\dots, K\}\); moreover, if there are \(N_{k}\) \((k=1,2,\dots, K)\) jobs of class \(k\) present in the system, then each class-\(k\) job's service rate is \(\frac{g_{k}}{\sum_{j=1}^{K}g_{j}N_{j}}\). Focusing on response times and numbers of jobs in the system, the authors give a very comprehensive overview for the DPS model. Hence, this paper provides a good key for readers to learn the DPS model.
    0 references
    0 references
    Discriminatory Processor Sharing
    0 references
    Asymptotic Analysis
    0 references
    M/G/1
    0 references
    Conservation Law
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers