Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Queues with Equally Heavy Sojourn Time and Service Requirement Distributions

14 references·10 citing·40 second hop

FromToDepth

this work references cited by second hop

References

1987Applied Probability and Queues2,704 cited
1983The Single Server Queue844 cited
1966The Queue M/G/1 with the Shortest Remaining Processing Time Discipline342 cited
2001Analysis of SRPT scheduling312 cited
1977Queueing Systems, Vol. II: Computer Applications.308 cited
1987Processor-sharing queues: Some progress in analysis189 cited
1973Some results on regular variation for distributions in queueing and fluctuation theory132 cited
2000Sojourn time asymptotics in the M/G/1 processor sharing queue106 cited
1992Mathematical problems in the theory of shared-processor systems77 cited
1971An Analysis of the M/G/1 Queue Under Round-Robin Scheduling73 cited
2000Processor-sharing models for integrated-services networks66 cited
1992On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes54 cited
2001Analysis of SRPT scheduling53 cited
2000Sojourn times in a processor sharing queue with service interruptions52 cited

Cited by

2008Preventing Large Sojourn Times Using SMART Scheduling49 cited

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

2008

Scheduling despite inexact job-size information

46 cited

2003Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue44 cited

2006Large deviations of sojourn times in processor sharing queues38 cited

2005Classifying scheduling policies with respect to higher moments of conditional response time34 cited

2007Scheduling for today's computer systems: bridging theory and practice33 cited

2002Heavy Tails: The Effect of the Service Discipline25 cited

2015Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling20 cited

2005Nearly insensitive bounds on SMART scheduling19 cited

2003Resource sharing with subexponential distributions19 cited