Skip to search formSkip to main contentSkip to account menu

Fair-share scheduling

Fair-share scheduling is a scheduling algorithm for computer operating systems in which the CPU usage is equally distributed among system users or… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Relaying and orthogonal frequency division multiple access (OFDMA) are the accepted technologies for emerging wireless… 
Highly Cited
2007
Highly Cited
2007
We propose a new fair scheduling technique, called OCGRR (output controlled grant-based round robin), for the support of DiffServ… 
Highly Cited
2006
Highly Cited
2006
  • M. Neely
  • 2006
  • Corpus ID: 10096224
We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time-varying channels. A… 
Highly Cited
2005
Highly Cited
2005
In MIMO downlink channels, the capacity is achieved by dirty paper coding (DPQ). However, DPC is difficult to implement in… 
Highly Cited
2005
Highly Cited
2005
Wireless Mesh Networks (WMNs) represent a new and promising paradigm that uses multi-hop communications to extend WiFi networks… 
2004
2004
There has been much recent interest in fair scheduling algorithms for real-time multiprocessor systems. The roots of much of the… 
Highly Cited
2003
Highly Cited
2003
A system based on orthogonal frequency division multiple access (OFDMA) has been developed to deliver mobile broadband data… 
Highly Cited
2001
Highly Cited
2001
This paper evaluates four mechanisms for providing service differentiation in IEEE 802.11 wireless LANs, the point coordinator… 
Highly Cited
1999
Highly Cited
1999
Fair queueing in the wireless domain poses significant challenges due to unique issues in the wireless channel such as location…