---
title: Generalized processor sharing
slug: generalized-processor-sharing
qid: 
snapshot: enwiki-001369580538
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1369580538
tags: [27424733]
---

# Generalized processor sharing

> [!note] Provenance
> Snapshot `enwiki-001369580538` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1369580538> · Licensed CC BY-SA 4.0

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).

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). 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.
