Generalized processor sharing

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Generalized processor sharing (GPS) is an ideal scheduling algorithm for process schedulers and network schedulers. It is related to the fair-queuing principle which groups packets into classes and shares the service capacity between them. GPS shares this capacity according to some fixed weights. In process scheduling, GPS is "an idealized scheduling algorithm that achieves perfect fairness. All practical schedulers approximate GPS and use it as a reference to measure fairness." Generalized processor sharing assumes that traffic is fluid (infinitesimal packet sizes), and can be arbitrarily split. There are several service disciplines which track the performance of GPS quite closely such as weighted fair queuing (WFQ), also known as packet-by-packet generalized processor sharing (PGPS).

How it works

Generalized processor sharing (GPS) is an ideal scheduling algorithm for process schedulers and network schedulers. It is related to the fair-queuing principle which groups packets into classes and shares the service capacity between them. GPS shares this capacity according to some fixed weights. In process scheduling, GPS is "an idealized scheduling algorithm that achieves perfect fairness.

Impact

All practical schedulers approximate GPS and use it as a reference to measure fairness." Generalized processor sharing assumes that traffic is fluid (infinitesimal packet sizes), and can be arbitrarily split. There are several service disciplines which track the performance of GPS quite closely such as weighted fair queuing (WFQ), also known as packet-by-packet generalized processor sharing (PGPS). R_i = \frac{w_i}{\sum_{j=1}^N w_j} R where R is the rate of the server. This is a minimal rate.

If some flow does not use its bandwidth during some period, this remaining capacity is shared by the active flows with regard to their respective weights. For example, consider a GPS server with w_1=2,w_2=w_3=1 . The first flow will receive at least half of the capacity, whereas the other two only get . Nevertheless, if on some time interval (s,t] , only the second and third flows are active, they will receive each one half of the capacity.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1369580538 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001369580538 · captured 1786822233.0 · version history

Cite this page as: encyclopegia.org, “Generalized processor sharing”, snapshot enwiki-001369580538. https://encyclopegia.org/a/generalized-processor-sharing

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.