SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
On the nonoptimality of the foreground-background discipline for IMRL service times
7 references·1 citing·28 second hop
On the nonoptimality of the foreground-background discipline for IMRL service times (2006)On the nonoptimality of the foreground-ba…ACM Sigmetrics Performance Evaluation Review (2018)ACM Sigmetrics Performance Ev…Two-level processor-sharing scheduling disciplines (2004)Two-level processor-sharing s…A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues (2003)A note on comparing response …On extremal service disciplines in single-stage queueing systems (1990)On extremal service disciplin…Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures (1989)Scheduling Multiclass Single …Processor-sharing queues: Some progress in analysis (1987)Processor-sharing queues: Som…Queueing Systems, Vol. II: Computer Applications. (1977)Queueing Systems, Vol. II: Co…Optimal scheduling of jobs with a DHR tail in the M/G/1 queue (2008)Optimal scheduling of jobs wi…Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline (1968)Classifying scheduling policies with respect to unfairness in an M/GI/1 (2003)Batch Arrival Processor-Sharing with Application to Multi-Level Processor-Sharing Scheduling (2005)Mean Delay Analysis of Multi Level Processor Sharing Disciplines (2006)Scheduling for today's computer systems: bridging theory and practice (2007)Work-conserving priorities (1970)Discriminatory processor sharing revisited (2005)Beyond processor sharing (2007)Size- and state-aware dispatching problem with queue-specific job sizes (2011)The Single Server Queue (1983)Comparison Methods for Queues and Other Stochastic Models. (1986)An introduction to queueing theory (1993)Sojourn time asymptotics in the M/G/1 processor sharing queue (2000)The fluid limit of a heavily loaded processor sharing queue (2002)A survey on discriminatory processor sharing (2006)Queueing systems, volume II: computer applications (1977)Multi-Armed Bandit Allocation Indices (1989)Multi-Armed Bandit Allocation Indices. (1990)Stochastic Modeling and the Theory of Queues (1989)Nearly insensitive bounds on SMART scheduling (2005)Scheduling in practice (2007)Dynamic Scheduling of a Multiclass Queue: Discount Optimality (1975)The c μ rule revisited (1985)Design of manufacturing systems using queueing models (1992)Monotonicity in Markov Reward and Decision Chains: Theory and Applications (2006)The Foreground–Background queue: A survey (2007)Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network (1990)On Pooling in Queueing Networks (1998)
this work references cited by second hop

References

  • 1977Queueing Systems, Vol. II: Computer Applications.308 cited
  • 1987Processor-sharing queues: Some progress in analysis189 cited
  • 1989Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures102 cited
  • 1990On extremal service disciplines in single-stage queueing systems66 cited
  • 2018ACM Sigmetrics Performance Evaluation Review55 cited
  • 2004Two-level processor-sharing scheduling disciplines38 cited
  • 2003A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues24 cited

Cited by

  • 2008Optimal scheduling of jobs with a DHR tail in the M/G/1 queue15 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work