The heavy traffic limit of an unbalanced generalized processor sharing model (Q2476397): Difference between revisions

Generalized Processor Sharing (GPS) is a scheduling discipline that is used to share a single processing among traffic from several sources. Given a single server that can process one unit of work per unit of time, and that is being shared by \(J\) \(\left( {1 < J < \infty } \right)\) sources, the information needed to implement the GPS policy is contained in the weight vector \(\alpha = (\alpha _1,\dots,\alpha _J )\). When all sources have a backlog of work, source \(j\) is allotted a fraction \(\alpha _j \) of the total capacity of the server. When some classes achieve no backlog by using less than their allotted capacity, the remaining service capacity of the server is split among the other sources in proportion to their \(\alpha _j \)'s. This redistribution is given by redistribution vector \(\beta = (\beta _1,\dots,\beta _J )\). The invariant manifold \(M\) of the so-called fluid limit associated with this model is identified explicitly in terms of the vectors \(\alpha \) and \(\beta \) and the long-range average work arrival rates \(\gamma _j \) of each source \(j\). In addition, under general assumption, it is shown that when the heavy traffic condition \(\sum\nolimits_{j = 1}^J {\gamma _j } = 1 = \sum\nolimits_{j = 1}^J {\alpha _j } \) holds, the functional central limit of the scaled unfinished work process is a reflected diffusion process that lies in \(M\).