SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A discrete-time round-robin queue with bernoulli input and general arithmetic service time distributions
7 references·2 citing·29 second hop
A discrete-time round-robin queue with bernoulli input and general arithmetic service time distributions (1981)A discrete-time round-robin queue with be…Sharing a Processor Among Many Job Classes (1980)Sharing a Processor Among Man…Warteschlangen (1973)WarteschlangenAn 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 Sharing with Priorities (1970)Time Sharing with PrioritiesA Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems (1970)A Queueing Theory Study of Ro…Analysis of A time‐shared processor (1964)Analysis of A time‐shared pro…Performance evaluation studies for time-sharing computer systems (1982)Performance evaluation studie…On the response time distribution in a discrete round-robin queue (1981)On the response time distribu…Queues, Inventories, and Maintenance (1958)A conservation law for a wide class of queueing disciplines (1965)The Queue M/G/1 With Feedback to Lower Priority Queues (1967)A Survey of Analytical Time-Sharing Models (1969)Introduction to the Theory of Queues. (1963)QUEUES AND INVENTORIES (1967)Time-shared Systems (1967)On the optimization of performance of time-sharing systems by simulation (1972)A Proof for the Queuing Formula: L = λ W (1961)General Stochastic Processes in the Theory of Queues (1964)Analysis of a Task Oriented Multipriority Queueing System (1981)Message delays at packet-switching nodes serving multiple classes (1990)Optimal scheduling policies in time sharing service systems (1995)Introduction to Queueing Theory (1982)An introduction to queueing theory (1993)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)A survey on discriminatory processor sharing (2006)Processor sharing: A survey of the mathematical theory (2007)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)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)A service model in which the server is required to search for customers (1984)On the Optimality of the Generalized Shortest Queue Policy (1990)Mathematical problems in the theory of shared-processor systems (1992)
this work references cited by second hop

References

  • 1970Waiting Time Distributions for Processor-Sharing Systems236 cited
  • 1980Sharing a Processor Among Many Job Classes175 cited
  • 1964Analysis of A time‐shared processor143 cited
  • 1973Warteschlangen94 cited
  • 1971An Analysis of the M/G/1 Queue Under Round-Robin Scheduling73 cited
  • 1970A Queueing Theory Study of Round-Robin Scheduling of Time-Shared Computer Systems34 cited
  • 1970Time Sharing with Priorities33 cited

Cited by

  • 1982Performance evaluation studies for time-sharing computer systems17 cited
  • 1981On the response time distribution in a discrete round-robin queue16 cited

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