SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Conditional response times in the M/G/1 processor-sharing system
7 references·7 citing·35 second hop
Conditional response times in the M/G/1 processor-sharing system (1983)Conditional response times in the M/G/1 p…A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates (1978)A Generalization of Erlang's …Direct Solutions of M/G/1 Processor-Sharing Models (1974)Direct Solutions of M/G/1 Pro…An Analysis of the M/G/1 Queue Under Round-Robin Scheduling (1971)An Analysis of the M/G/1 Queu…Waiting Time Distributions for Processor-Sharing Systems (1970)Waiting Time Distributions fo…Time-shared Systems (1967)Time-shared SystemsA Proof for the Queuing Formula: L = λ W (1961)A Proof for the Queuing Formu…On Queues with Poisson Arrivals (1957)On Queues with Poisson Arriva…The processor-sharing queue with bulk arrivals and phase-type services (2006)The processor-sharing queue w…The M/G/1 processor-sharing queue with disasters (2006)The M/G/1 processor-sharing q…Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue (2006)Insensitive bounds for the mo…Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing (2004)Sojourn time distribution in …Stationary increments in the accumulated work process in processor-sharing queues (1989)Stationary increments in the …A Functional Equation Arising in a Queue With a Gating Mechanism (1989)A Functional Equation Arising…Server sharing with a limited number of service positions and symmetric queues (1987)Server sharing with a limited…Analysis of A time‐shared processor (1964)Sharing a Processor Among Many Job Classes (1980)Introduction to Queueing Theory and Stochastic Teletraffic Models (2013)The Queue M/G/1 With Feedback to Lower Priority Queues (1967)A decomposition theorem and related results for the discriminatory processor sharing queue (1994)Differentiated bandwidth sharing with disparate flow sizes (2005)The theory of queues with a single server (1952)Fluctuation theory in continuous time (1975)Fluctuation theory in continuous time (1975)Processor sharing: A survey of the mathematical theory (2007)Processor-sharing queues: Some progress in analysis (1987)Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues (2005)Analysis of the M/G/1 queue with discriminatory random order service policy (2010)Fluid approximation of closed queueing networks with discriminatory processor sharing (2020)Introduction to the Theory of Queues. (1963)Processor-sharing models for integrated-services networks (2000)The equivalence between processor sharing and service in random order (2003)The impact of the service discipline on delay asymptotics (2003)Product-form queueing networks with negative and positive customers (1991)The mean-field behavior of processor sharing systems with general job lengths under the SQ( d ) policy (2018)Insensitivity of the mean field limit of loss systems under SQ( d ) routeing (2019)Comparison Methods for Queues and Other Stochastic Models (1984)Comparison Methods for Queues and Other Stochastic Models. (1986)Waiting times for M/M systems under state-dependent processor sharing (2008)Simple Near-Optimal Scheduling for the M/G/1 (2020)On Erlang's Formula (1969)On the relation between customer and time averages in queues (1971)Distribution of the Interoverflow Time for the GI / G /1 Loss System (1981)On the arrivai theorem for product form queueing networks with blocking (1997)Service parts inventory control with lateral transshipment and pipeline stockflexibility (2012)The sojourn-time distribution in the M/G/1 queue by processor sharing (1984)Sojourn time asymptotics in the M/G/1 processor sharing queue (2000)An Equilibrium Queuing Model of Bribery (1985)An exploration towards a production theory and its application to construction (2000)How to improve R&D productivity: the pharmaceutical industry's grand challenge (2010)
this work references cited by second hop

References

  • 1961A Proof for the Queuing Formula: L = λ W2,777 cited
  • 1967Time-shared Systems368 cited
  • 1970Waiting Time Distributions for Processor-Sharing Systems236 cited
  • 1957On Queues with Poisson Arrivals102 cited
  • 1971An Analysis of the M/G/1 Queue Under Round-Robin Scheduling73 cited
  • 1978A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates52 cited
  • 1974Direct Solutions of M/G/1 Processor-Sharing Models38 cited

Cited by

  • 2004Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing24 cited
  • 2006Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue21 cited
  • 2006The M/G/1 processor-sharing queue with disasters18 cited
  • 1987Server sharing with a limited number of service positions and symmetric queues15 cited
  • 2006The processor-sharing queue with bulk arrivals and phase-type services13 cited
  • 1989A Functional Equation Arising in a Queue With a Gating Mechanism11 cited
  • 1989Stationary increments in the accumulated work process in processor-sharing queues10 cited

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