SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Waiting times in queues with relative priorities
5 references·2 citing·24 second hop
Waiting times in queues with relative priorities (2006)Waiting times in queues with relative pri…A survey on discriminatory processor sharing (2006)A survey on discriminatory pr…Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities (1997)Equilibrium Strategies for Pr…Sharing a Processor Among Many Job Classes (1980)Sharing a Processor Among Man…Complete parameterized families of job scheduling strategies (1977)Complete parameterized famili…Priority Assignment in Waiting Line Problems (1954)Priority Assignment in Waitin…Analysis of the M/G/1 queue with discriminatory random order service policy (2010)Analysis of the M/G/1 queue w…Who should be given priority in a queue? (2005)Who should be given priority …A conservation law for a wide class of queueing disciplines (1965)Time-shared Systems (1967)A decomposition theorem and related results for the discriminatory processor sharing queue (1994)The use of relative priorities in optimizing the performance of a queueing system (2007)Queueing Systems, Volume 2: Computer Applications. (1978)Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue (1990)To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems (2003)Strategic Overtaking in a Monopolistic M/M/1 Queue (2015)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)The multiple phase service network with generalized processor sharing (1979)M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules (1988)Processor sharing: A survey of the mathematical theory (2007)Purchasing Priorities in Queues (1972)Equilibrium Threshold Strategies: The Case of Queues with Priorities (1997)Self-Regulation of an Unobservable Queue (2017)Empirical Work on Auctions of Multiple Objects (2018)Elements of Queueing Theory (2003)Sojourn time asymptotics in processor-sharing queues (2006)Beyond processor sharing (2007)Delay Distributions for One Line with Poisson Input, General Holding Times, and Various Orders of Service (1963)Queue-Length Distribution for the Discriminatory Processor-Sharing Queue (1996)The Queue M/G/1 with the Shortest Remaining Processing Time Discipline (1966)The origin of bursts and heavy tails in human dynamics (2005)Modeling bursts and heavy tails in human dynamics (2006)
this work references cited by second hop

References

  • 1954Priority Assignment in Waiting Line Problems417 cited
  • 1980Sharing a Processor Among Many Job Classes175 cited
  • 2006A survey on discriminatory processor sharing112 cited
  • 1997Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities37 cited
  • 1977Complete parameterized families of job scheduling strategies33 cited

Cited by

  • 2005Who should be given priority in a queue?23 cited
  • 2010Analysis of the M/G/1 queue with discriminatory random order service policy16 cited

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