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)

Related topics

Related topics

8 relations
Central processing unitList of algorithmsLottery schedulingMultilevel feedback queue

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Unified Analysis of Multiuser Scheduling for Downlink MIMO Systems with Imperfect CSI
In this paper, unified BER performance and outage probability analyses of downlink multiuser scheduling for multiple-input… 
2013
2013
Resource Allocation in Cognitive Radio Relay Networks
Cognitive radio has received great attention recently for its ability to improve spectrum efficiency by letting secondary users… 
2013
2013
QoS investigation of proportional fair scheduling in LTE networks
In this paper, the quality of service in a Long Term Evolution (LTE) network with respect to the employed scheduling strategy and… 
2012
2012
Combating Interference: MU-MIMO, CoMP, and HetNet (Invited Paper)
Combating interference is one of the most outstanding challenges in wireless communication networks, especially for cellular… 
2011
2011
Proportional Fair Resource Partition for LTE-Advanced Networks with Type I Relay Nodes
In 3GPP LTE-Advanced networks deployed with type I relay nodes (RNs), resource partition is required to support in-band relaying… 
2009
2009
Performance of proportional fair frequency and time domain scheduling in LTE uplink
Channel-aware scheduling is one of the advanced features introduced in the uplink of Long Term Evolution (LTE) in order to… 
2007
2007
A Novel Proportional Fair Scheduling Algorithm for HSDPA in UMTS Networks
A utility function based perspective of packet scheduling in HSDPA is described and a new hybrid proportional fair scheduling… 
Highly Cited
2005
Highly Cited
2005
Predictive congestion control MAC protocol for wireless sensor networks
Available congestion control schemes, for example transport control protocol (TCP), when applied to wireless networks results in… 
2001
2001
Fair Scheduling for Input Buffered Switches
  • N. NiL. Bhuyan
  • Proceedings, International Parallel and…
  • 2001
  • Corpus ID: 8526263
Input buffered switch architecture has become attractive for implementing high performance switches for workstation clusters. It… 
2001
2001
Fair scheduling with bottleneck consideration in wireless ad-hoc networks
Most research work in the area of wireless ad-hoc networks attempts to balance the trade-off between fairness and channel… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)