Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Generalized processor sharing

Known as: GPS (disambiguation), Generalized processor-sharing 
Generalized processor sharing (GPS) is an ideal scheduling algorithm for network schedulers. It is related to the Fair queuing principle, that groups… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
QJUMP is a simple and immediately deployable approach to controlling network interference in datacenter networks. Network… Expand
  • figure 9
  • figure 9
  • figure 11
Is this relevant?
2012
2012
End-hosts are increasingly equipped with multiple network interfaces, ranging from smartphones with multiple radios to servers… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The issue of Quality of Service (QoS) performance analysis in packet switching networks has drawn a lot of attention in the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
In constant-bandwidth server (CBS) systems, several different applications are executed upon a shared computing platform in such… Expand
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We analyze the asymptotic behavior of long-tailed traffic sources under the generalized processor sharing (GPS) discipline. GPS… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper we consider a stochastic server (modeling a multiclass communication switch) fed by a set of parallel buffers. The… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We develop bounds on the individual session backlog and delay distribution under the generalized processor sharing (GPS… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
  • A. Parekh
  • IEEE INFOCOM '93 The Conference on Computer…
  • 1993
  • Corpus ID: 32035854
Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The problem of allocating network resources to the users of an integrated services network is investigated in the context of rate… Expand
  • figure 3.1
  • figure 6.1
  • figure 6.2
  • figure 7.2
  • figure 7.3
Is this relevant?