SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Time-shared Systems
1 references·16 citing·40 second hop
Time-shared Systems (1967)Time-shared SystemsA Proof for the Queuing Formula: L = λ W (1961)A Proof for the Queuing Formu…Introduction to Queueing Theory and Stochastic Teletraffic Models (2013)Introduction to Queueing Theo…Processor sharing: A survey of the mathematical theory (2007)Processor sharing: A survey o…Beyond processor sharing (2007)Beyond processor sharingSojourn time asymptotics in processor-sharing queues (2006)Sojourn time asymptotics in p…A survey on discriminatory processor sharing (2006)A survey on discriminatory pr…Discriminatory processor sharing revisited (2005)Discriminatory processor shar…A resource-allocation queueing fairness measure (2004)A resource-allocation queuein…The equivalence between processor sharing and service in random order (2003)The equivalence between proce…Processor-sharing models for integrated-services networks (2000)Processor-sharing models for …Queue-Length Distribution for the Discriminatory Processor-Sharing Queue (1996)Queue-Length Distribution for…Mathematical problems in the theory of shared-processor systems (1992)Mathematical problems in the …Sharing a Processor Among Many Job Classes (1980)Sharing a Processor Among Man…A Characterization of Waiting Time Performance Realizable by Single-Server Queues (1980)A Characterization of Waiting…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…Feedback Queueing Models for Time-Shared Systems (1968)Feedback Queueing Models for …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)Elements of Queueing Theory (2003)To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems (2003)Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences (2010)Fundamentals of Queueing Theory. (1977)Modelling of extremal events in insurance and finance (1994)Modelling Extremal Events (1997)Blocking probabilities of elastic and adaptive calls in the Erlang multirate loss model under the threshold policy (2015)Congestion probabilities of elastic and adaptive calls in Erlang-Engset multirate loss models under the threshold and bandwidth reservation policies (2015)WCFS: a new framework for analyzing multiserver systems (2022)Priority Assignment in Waiting Line Problems (1954)Introduction to the Theory of Queues (1963)Introduction to the Theory of Queues. (1963)Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System (1972)AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue (2005)The Foreground–Background queue: A survey (2007)OR Forum—Perspectives on Queues: Social Justice and the Psychology of Queueing (1987)Classifying scheduling policies with respect to unfairness in an M/GI/1 (2003)QUANTIFYING FAIRNESS IN QUEUING SYSTEMS (2008)Scheduling despite inexact job-size information (2008)Fairness and scheduling in single server queues (2010)Point Processes and Queues: Martingale Dynamics. (1983)Multi-Armed Bandit Allocation Indices. (1990)An introduction to queueing theory (1993)On the Gittins index in the M/G/1 queue (2009)Time Series Analysis, Forecasting, and Control (1995)Introduction to Matrix Analytic Methods in Stochastic Modeling (1999)Beta/M/1 Model for Machine Type Communication (2013)Modelling passenger service rate at a transport hub serviced by a single urban bus route as a queueing system (2019)The sojourn-time distribution in the M/G/1 queue by processor sharing (1984)Processor-sharing queues: Some progress in analysis (1987)Sojourn time asymptotics in the M/G/1 processor sharing queue (2000)Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic (2000)Analysis, Design, and Control of Queueing Systems (2002)Dynamic priority allocation via restless bandit marginal productivity indices (2007)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

Cited by

  • 1970Waiting Time Distributions for Processor-Sharing Systems236 cited
  • 1980Sharing a Processor Among Many Job Classes175 cited
  • 2013Introduction to Queueing Theory and Stochastic Teletraffic Models157 cited
  • 1980A Characterization of Waiting Time Performance Realizable by Single-Server Queues156 cited
  • 2006A survey on discriminatory processor sharing112 cited
  • 2007Processor sharing: A survey of the mathematical theory95 cited
  • 1968Feedback Queueing Models for Time-Shared Systems92 cited
  • 2004A resource-allocation queueing fairness measure82 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
  • 2007Beyond processor sharing62 cited
  • 1996Queue-Length Distribution for the Discriminatory Processor-Sharing Queue59 cited
  • 2005Discriminatory processor sharing revisited57 cited
  • 2003

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

The equivalence between processor sharing and service in random order
54 cited
  • 2006Sojourn time asymptotics in processor-sharing queues53 cited