SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Analysis of A time‐shared processor
1 references·16 citing·35 second hop
Analysis of A time‐shared processor (1964)Analysis of A time‐shared processorQueues, Inventories, and Maintenance (1958)Queues, Inventories, and Main…Self-adaptive admission control policies for resource-sharing systems (2009)Self-adaptive admission contr…Tails in scheduling (2007)Tails in schedulingSojourn time asymptotics in processor-sharing queues (2006)Sojourn time asymptotics in p…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 …TheM/G/1 retrial queue with the server subject to starting failures (1994)TheM/G/1 retrial queue with t…On job assignment for a parallel system of processor sharing queues (1990)On job assignment for a paral…Analysis of fork-join program response times on multiprocessors (1990)Analysis of fork-join program…Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System (1972)Processor Sharing Queueing Mo…The processor‐sharing queueing model for time‐shared systems with bulk arrivals (1971)The processor‐sharing queuein…A Survey of Analytical Time-Sharing Models (1969)A Survey of Analytical Time-S…Feedback Queueing Models for Time-Shared Systems (1968)Feedback Queueing Models for …Computer scheduling methods and their countermeasures (1968)Computer scheduling methods a…The Queue M/G/1 With Feedback to Lower Priority Queues (1967)The Queue M/G/1 With Feedback…A conservation law for a wide class of queueing disciplines (1965)A conservation law for a wide…Applied Probability and Queues (1987)Modelling of extremal events in insurance and finance (1994)Modelling Extremal Events (1997)Beyond processor sharing (2007)Is Tail-Optimal Scheduling Possible? (2012)Open problems in queueing theory inspired by datacenter computing (2021)A Single-Server Queue with Feedback (1963)Introduction to the Theory of Queues. (1963)The Queue M/G/1 with the Shortest Remaining Processing Time Discipline (1966)The Foreground–Background queue: A survey (2007)The theory of queues with a single server (1952)Priority Assignment in Waiting Line Problems (1954)A Proof for the Queuing Formula: L = λ W (1961)Dynamic priority allocation via restless bandit marginal productivity indices (2007)Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain (1953)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)The Single Server Queue (1983)Large deviations of sojourn times in processor sharing queues (2006)Scheduling for today's computer systems: bridging theory and practice (2007)Introduction to the Theory of Queues (1963)AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue (2005)Jobshop-Like Queueing Systems (1963)Jobshop-Like Queueing Systems (2004)Time-shared Systems (1967)Waiting Time Distributions for Processor-Sharing Systems (1970)OR Forum—Perspectives on Queues: Social Justice and the Psychology of Queueing (1987)QUANTIFYING FAIRNESS IN QUEUING SYSTEMS (2008)Scheduling despite inexact job-size information (2008)Fairness and scheduling in single server queues (2010)Poisson Arrivals See Time Averages (1982)Preventing Large Sojourn Times Using SMART Scheduling (2008)SOAP (2018)Optimal disposal policies for a single‐item inventory system with returns (1977)Analysis, Design, and Control of Queueing Systems (2002)Optimal design and control of queues (2005)
this work references cited by second hop

References

  • 1958Queues, Inventories, and Maintenance176 cited

Cited by

  • 1967The Queue M/G/1 With Feedback to Lower Priority Queues108 cited
  • 1965A conservation law for a wide class of queueing disciplines104 cited
  • 1969A Survey of Analytical Time-Sharing Models95 cited
  • 1968Feedback Queueing Models for Time-Shared Systems92 cited
  • 2007Tails in scheduling86 cited
  • 2004A resource-allocation queueing fairness measure82 cited
  • 2000Processor-sharing models for integrated-services networks66 cited
  • 2003The equivalence between processor sharing and service in random order54 cited
  • 2006Sojourn time asymptotics in processor-sharing queues53 cited
  • 1994TheM/G/1 retrial queue with the server subject to starting failures52 cited
  • 2009Self-adaptive admission control policies for resource-sharing systems49 cited
  • 1972Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System49 cited
  • 1968Computer scheduling methods and their countermeasures48 cited
  • 1971The processor‐sharing queueing model for time‐shared systems with bulk arrivals47 cited

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

  • 1990On job assignment for a parallel system of processor sharing queues43 cited
  • 1990Analysis of fork-join program response times on multiprocessors43 cited