Concepts inAnalysis of SRPT scheduling: investigating unfairness

Scheduling (computing)

In computer science, scheduling is the method by which threads, processes or data flows are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to load balance a system effectively or achieve a target quality of service. The need for a scheduling algorithm arises from the requirement for most modern systems to perform multitasking (execute more than one process at a time) and multiplexing (transmit multiple flows simultaneously).  more from Wikipedia

Heavy-tailed distribution

In probability theory, heavy-tailed distributions are probability distributions whose tails are not exponentially bounded: that is, they have heavier tails than the exponential distribution. In many applications it is the right tail of the distribution that is of interest, but a distribution may have a heavy left tail, or both tails may be heavy.  more from Wikipedia

M/G/1 queue

In queueing theory, an M/G/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 can have an arbitrary distribution. The model name is written in Kendall's notation, and is an extension of the M/M/1 queue, where service times must be exponentially distributed. The classic application of the M/G/1 queue is to model performance of a fixed head hard disk.  more from Wikipedia

Closed-form expression

In mathematics, an expression is said to be a closed-form expression if it can be expressed analytically in terms of a finite number of certain "well-known" functions. Typically, these well-known functions are defined to be elementary functions¿constants, one variable x, elementary operations of arithmetic (+ ¿ × ÷), nth roots, exponent and logarithm (which thus also include trigonometric functions and inverse trigonometric functions).  more from Wikipedia

Job shop scheduling

Job shop scheduling is an optimization problem in computer science in which ideal jobs are assigned to resources at particular times. The most basic version is as follows: We are given n jobs J1, J2, ... , Jn of varying sizes, which need to be scheduled on m identical machines, while trying to minimize the makespan. The makespan is the total length of the schedule (that is, when all the jobs have finished processing).  more from Wikipedia

Mean and predicted response

In linear regression mean response and predicted response are values of the dependent variable calculated from the regression parameters and a given value of the independent variable. The values of these two responses are the same, but their calculated variances are different.  more from Wikipedia

Property

Property is any physical or intangible entity that is owned by a person or jointly by a group of people or a legal entity like a corporation. Depending on the nature of the property, an owner of property has the right to consume, sell, rent, mortgage, transfer, exchange or destroy it, or to exclude others from doing these things.  more from Wikipedia