Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A decomposition theorem and related results for the discriminatory processor sharing queue

9 references·8 citing·36 second hop

FromToDepth

this work references cited by second hop

References

1967Time-shared Systems366 cited
1970Waiting Time Distributions for Processor-Sharing Systems236 cited
1987Processor-sharing queues: Some progress in analysis189 cited
1980Sharing a Processor Among Many Job Classes175 cited
1984The sojourn-time distribution in the M/G/1 queue by processor sharing115 cited
1984A new approach to the M / G /1 processor-sharing queue86 cited
1991TheM/G/1 queue with processor sharing and its relation to a feedback queue62 cited
1974Direct Solutions of M/G/1 Processor-Sharing Models38 cited
1977Complete parameterized families of job scheduling strategies33 cited

Cited by

2005Who should be given priority in a queue?23 cited
2005Exact and approximate analysis of sojourn times in finite discriminatory processor sharing queues22 cited
2007The use of relative priorities in optimizing the performance of a queueing system21 cited
2003Generalized processor sharing queues20 cited
2011Dispatching problem with fixed size jobs and processor sharing discipline18 cited
2007Mean sojourn times for phase-type discriminatory processor sharing systems16 cited

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

2020Fluid approximation of closed queueing networks with discriminatory processor sharing14 cited

2017Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations13 cited