Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,268,575 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Central processing unit
List of algorithms
Lottery scheduling
Multilevel feedback queue
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
An optimal boundary fair scheduling algorithm for multiprocessor real-time systems
Dakai Zhu
,
Xuan Qi
,
D. Mossé
,
R. Melhem
J. Parallel Distributed Comput.
2011
Corpus ID: 14021697
Highly Cited
2010
Highly Cited
2010
Fairness-aware radio resource management in downlink OFDMA cellular relay networks
M. Salem
,
A. Adinoyi
,
Mahmudur Rahman
,
H. Yanikomeroglu
,
D. Falconer
,
Young-Doo Kim
IEEE Transactions on Wireless Communications
2010
Corpus ID: 890992
Relaying and orthogonal frequency division multiple access (OFDMA) are the accepted technologies for emerging wireless…
Expand
Highly Cited
2007
Highly Cited
2007
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
Runfang Zhou
,
Kai Hwang
IEEE Transactions on Parallel and Distributed…
2007
Corpus ID: 195917351
We propose a new fair scheduling technique, called OCGRR (output controlled grant-based round robin), for the support of DiffServ…
Expand
Highly Cited
2006
Highly Cited
2006
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
M. Neely
Proceedings IEEE INFOCOM . 25TH IEEE…
2006
Corpus ID: 10096224
We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time-varying channels. A…
Expand
Highly Cited
2005
Highly Cited
2005
Optimality of zero-forcing beamforming with multiuser diversity
Taesang Yoo
,
A. Goldsmith
IEEE International Conference on Communications…
2005
Corpus ID: 14300680
In MIMO downlink channels, the capacity is achieved by dirty paper coding (DPQ). However, DPC is difficult to implement in…
Expand
Highly Cited
2005
Highly Cited
2005
A Fair Scheduling for Wireless Mesh Networks
N. Salem
,
J. Hubaux
2005
Corpus ID: 55507061
Wireless Mesh Networks (WMNs) represent a new and promising paradigm that uses multi-hop communications to extend WiFi networks…
Expand
2004
2004
Fair Scheduling of Real-Time Tasks on Multiprocessors
James H. Anderson
,
Philip Holman
,
A. Srinivasan
Handbook of Scheduling
2004
Corpus ID: 12549461
There has been much recent interest in fair scheduling algorithms for real-time multiprocessor systems. The roots of much of the…
Expand
Highly Cited
2003
Highly Cited
2003
QoS aware adaptive resource allocation techniques for fair scheduling in OFDMA based broadband wireless access systems
M. Ergen
,
S. Ergen
,
P. Varaiya
IEEE transactions on broadcasting
2003
Corpus ID: 829414
A system based on orthogonal frequency division multiple access (OFDMA) has been developed to deliver mobile broadband data…
Expand
Highly Cited
2001
Highly Cited
2001
Evaluation of quality of service schemes for IEEE 802.11 wireless LANs
Andreas Almquist
,
Andreas Lindgren
,
O. Schelén
Proceedings LCN . 26th Annual IEEE Conference on…
2001
Corpus ID: 1054144
This paper evaluates four mechanisms for providing service differentiation in IEEE 802.11 wireless LANs, the point coordinator…
Expand
Highly Cited
1999
Highly Cited
1999
A Unified Architecture for the Design and Evaluation of Wireless Fair Queueing Algorithms
T. Nandagopal
,
Songwu Lu
,
V. Bharghavan
Wirel. Networks
1999
Corpus ID: 15500177
Fair queueing in the wireless domain poses significant challenges due to unique issues in the wireless channel such as location…
Expand
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)
ACCEPT & CONTINUE
or Only Accept Required