SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Feedback Queueing Models for Time-Shared Systems
9 references·9 citing·30 second hop
Feedback Queueing Models for Time-Shared Systems (1968)Feedback Queueing Models for Time-Shared …Time-shared Systems (1967)Time-shared SystemsThe Queue M/G/1 With Feedback to Lower Priority Queues (1967)The Queue M/G/1 With Feedback…The Queue M/G/1 with the Shortest Remaining Processing Time Discipline (1966)The Queue M/G/1 with the Shor…AN ANALYSIS OF TIME-SHARED COMPUTER SYSTEMS (1965)AN ANALYSIS OF TIME-SHARED CO…A conservation law for a wide class of queueing disciplines (1965)A conservation law for a wide…Analysis of A time‐shared processor (1964)Analysis of A time‐shared pro…Introduction to the Theory of Queues. (1963)Introduction to the Theory of…Introduction to the Theory of Queues (1963)Introduction to the Theory of…Priority Assignment in Waiting Line Problems (1954)Priority Assignment in Waitin…The Foreground–Background queue: A survey (2007)The Foreground–Background que…AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue (2005)AnRG-Factorization Approach f…Analysis of a discrete multipriority queueing system involving a central shared processor serving many local queues (1991)Analysis of a discrete multip…Performance evaluation studies for time-sharing computer systems (1982)Performance evaluation studie…On Optimal Scheduling Algorithms for Time-Shared Systems (1981)On Optimal Scheduling Algorit…Adaptive Allocation of Central Processing Unit Quanta (1976)Adaptive Allocation of Centra…Synthesis of a Feedback Queueing Discipline for Computer Operation (1974)Synthesis of a Feedback Queue…Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System (1972)Processor Sharing Queueing Mo…Design considerations of statistical multiplexors (1969)Design considerations of stat…Queues, Inventories, and Maintenance (1958)A Survey of Analytical Time-Sharing Models (1969)A Proof for the Queuing Formula: L = λ W (1961)A Classified Bibliography of Research on Optimal Design and Control of Queues (1977)A simple dynamic routing problem (1980)Analysis of SRPT scheduling (2001)A Single-Server Queue with Feedback (1963)A general class of Markov processes with explicit matrix-geometric solutions (1986)The theory of queues with a single server (1952)Time Dependent Priority Queues (1967)Dynamic priority allocation via restless bandit marginal productivity indices (2007)Queueing systems, volume II: computer applications (1977)The Single Server Queue (1983)Multi-Armed Bandit Allocation Indices. (1990)Preventing Large Sojourn Times Using SMART Scheduling (2008)Fairness and scheduling in single server queues (2010)Is Tail-Optimal Scheduling Possible? (2012)Diffusion approximations and models for certain congestion problems (1968)Fundamental operational laws of computer system performance (1976)Twenty Five Years of Cyclic Queues and Closed Queue Networks: A Review (1982)Waiting Time Distributions for Processor-Sharing Systems (1970)Sharing a Processor Among Many Job Classes (1980)Introduction to Queueing Theory and Stochastic Teletraffic Models (2013)The origin of bursts and heavy tails in human dynamics (2005)Modeling bursts and heavy tails in human dynamics (2006)A General Class of Bulk Queues with Poisson Input (1967)Stochastic Processes for Insurance and Finance (1999)Coping with Time‐Varying Demand When Setting Staffing Requirements for a Service System (2007)The N/G/1 queue and its detailed analysis (1980)M/G/1 queue with multiple working vacations (2005)
this work references cited by second hop

References

  • 1963Introduction to the Theory of Queues.961 cited
  • 1963Introduction to the Theory of Queues420 cited
  • 1954Priority Assignment in Waiting Line Problems417 cited
  • 1967Time-shared Systems366 cited
  • 1966The Queue M/G/1 with the Shortest Remaining Processing Time Discipline342 cited
  • 1965AN ANALYSIS OF TIME-SHARED COMPUTER SYSTEMS164 cited
  • 1964Analysis of A time‐shared processor143 cited
  • 1967The Queue M/G/1 With Feedback to Lower Priority Queues108 cited
  • 1965A conservation law for a wide class of queueing disciplines104 cited

Cited by

  • 2007The Foreground–Background queue: A survey87 cited
  • 1972Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System49 cited
  • 2005AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue32 cited
  • 1981On Optimal Scheduling Algorithms for Time-Shared Systems28 cited
  • 1991Analysis of a discrete multipriority queueing system involving a central shared processor serving many local queues27 cited
  • 1976Adaptive Allocation of Central Processing Unit Quanta20 cited

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

1982
Performance evaluation studies for time-sharing computer systems
17 cited
  • 1969Design considerations of statistical multiplexors16 cited
  • 1974Synthesis of a Feedback Queueing Discipline for Computer Operation14 cited