Diffusion approximation for a processor sharing queue in heavy traffic. (Q1879882)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2100747
Language Label Description Also known as
default for all languages
No label defined
    English
    Diffusion approximation for a processor sharing queue in heavy traffic.
    scientific article; zbMATH DE number 2100747

      Statements

      Diffusion approximation for a processor sharing queue in heavy traffic. (English)
      0 references
      15 September 2004
      0 references
      The paper presents a heavy traffic diffusion approximation for a measure valued process \(\{\mu(t): t\geq 0\}\) that keeps track of the residual service times of jobs in the buffer of a \(GI/G/1\) processor sharing queue. Each job in the buffer is being processed at a rate that is the reciprocal of the number of jobs in the buffer. When the server has fulfilled a given job's service time requirement, the job exits the buffer. The residual service time at time \(t\geq 0\) of a job which has entered the buffer by time \(t\), is given by the amount of processing time originally requested by the job minus the total amount of processing time it has received by time \(t\). For each \(t\geq 0\), \(\mu(t)\) is the random element of the space of finite, nonnegative Borel measures on \([0,\infty)\), that has a unit of mass at the residual service time of each job currently in the buffer at time \(t\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references