Generalized processor sharing

Generalized processor sharing (GPS) is an ideal <a href="/facts/Scheduling_algorithm/XptmcM1a">scheduling algorithm</a> for <a href="/facts/Scheduling_(computing)/XptmcM1a">process schedulers</a> and <a href="/facts/Network_scheduler/7URA71LE">network schedulers</a>. It is related to the <a href="/facts/Fair_queuing/hwv3AIud">fair-queuing principle</a> 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 (<a href="/facts/Infinitesimal/JKcTMIgD">infinitesimal</a> packet sizes), and can be arbitrarily split. There are several service disciplines which track the performance of GPS quite closely such as <a href="/facts/Weighted_fair_queuing/DU2FCx3p">weighted fair queuing</a> (WFQ), also known as packet-by-packet generalized processor sharing (PGPS).

Generalized processor sharing open-in-new

Generalized processor sharing