Faster access than browser!
10 relations: Geometric distribution, Journal of the ACM, M/G/1 queue, M/M/1 queue, Poisson point process, Policy, Queueing Systems, Queueing theory, Round-robin scheduling, Scheduling (computing).
Geometric distribution
In probability theory and statistics, the geometric distribution is either of two discrete probability distributions.
New!!: Processor sharing and Geometric distribution · See more »
Journal of the ACM
The Journal of the ACM is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects.
New!!: Processor sharing and Journal of the ACM · See more »
M/G/1 queue
In queueing theory, a discipline within the mathematical theory of probability, an M/G/1 queue is a queue model where arrivals are Markovian (modulated by a Poisson process), service times have a General distribution and there is a single server.
New!!: Processor sharing and M/G/1 queue · See more »
M/M/1 queue
In queueing theory, a discipline within the mathematical theory of probability, an M/M/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times have an exponential distribution.
New!!: Processor sharing and M/M/1 queue · See more »
Poisson point process
In probability, statistics and related fields, a Poisson point process or Poisson process (also called a Poisson random measure, Poisson random point field or Poisson point field) is a type of random mathematical object that consists of points randomly located on a mathematical space.
New!!: Processor sharing and Poisson point process · See more »
Policy
A policy is a deliberate system of principles to guide decisions and achieve rational outcomes.
New!!: Processor sharing and Policy · See more »
Queueing Systems
Queueing Systems is a peer-reviewed scientific journal covering queueing theory.
New!!: Processor sharing and Queueing Systems · See more »
Queueing theory
Queueing theory is the mathematical study of waiting lines, or queues.
New!!: Processor sharing and Queueing theory · See more »
Round-robin scheduling
Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing.
New!!: Processor sharing and Round-robin scheduling · See more »
Scheduling (computing)
In computing, scheduling is the method by which work specified by some means is assigned to resources that complete the work.
New!!: Processor sharing and Scheduling (computing) · See more »
Redirects here:
Discriminatory processor sharing, Egalitarian processor sharing, Multilevel processor sharing.
