Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,643,581 papers from all fields of science
Search
Sign In
Create Free Account
Proportional share scheduling
Proportional Share Scheduling is a type of scheduling that preallocates certain amount of CPU time to each of the processes. In a proportional share…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
2 relations
Scheduling (computing)
Stride scheduling
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Dynamic Proportional Share Scheduling in Hadoop
Thomas Sandholm
,
Kevin Lai
JSSPP
2010
Corpus ID: 1053292
We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by…
Expand
2010
2010
Asymmetric Non-Uniform Proportional Share Scheduling
Michael S. Dunn
2010
Corpus ID: 168094073
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 List of Figures…
Expand
Highly Cited
2007
Highly Cited
2007
Proportional-Share Scheduling for Distributed Storage Systems
Yin Wang
,
A. Merchant
FAST
2007
Corpus ID: 5658198
Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity…
Expand
Highly Cited
2007
Highly Cited
2007
Burst Round Robin as a Proportional-Share Scheduling Algorithm
T. Helmy
,
A. Dekdouk
2007
Corpus ID: 14035652
In this paper we introduce Burst Round Robin, a proportional-share scheduling algorithm as an attempt to combine the low…
Expand
Highly Cited
2005
Highly Cited
2005
Group Ratio Round-Robin: O(1) Proportional Share Scheduling for Uniprocessor and Multiprocessor Systems
Bogdan Caprita
,
W. C. Chan
,
Jason Nieh
,
C. Stein
,
Haoqiang Zheng
USENIX Annual Technical Conference, General Track
2005
Corpus ID: 6945875
We present Group Ratio Round-Robin (GR3), the first proportional share scheduler that combines accurate proportional fairness…
Expand
Highly Cited
2004
Highly Cited
2004
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
F. Kashani
,
C. Shahabi
CIKM '04
2004
Corpus ID: 9581645
Peer-to-peer Data Networks (PDNs) are large-scale, self-organizing, distributed query processing systems. Familiar examples of…
Expand
1999
1999
Proportional-share scheduling in single-server and multiple-server computing systems
D. Epema
,
J. D. Jongh
PERV
1999
Corpus ID: 11454463
Proportional Share Scheduling (PSS), which is the allocation of prespecified fractions of a certain resource to different classes…
Expand
Highly Cited
1998
Highly Cited
1998
Proportional share scheduling of operating system services for real-time applications
K. Jeffay
,
F. D. Smith
,
A. Moorthy
,
James H. Anderson
Proceedings 19th IEEE Real-Time Systems Symposium…
1998
Corpus ID: 875227
While there is currently great interest in the problem of providing real time services in general purpose operating systems, the…
Expand
Highly Cited
1997
Highly Cited
1997
Extending Proportional-Share Scheduling to a Network of Workstation
A. Arpaci-Dusseau
,
D. Culler
PDPTA
1997
Corpus ID: 17020266
As networks of workstations (NOW) emerge as a viable platform for a wide range of workloads, a new scheduling approach is needed…
Expand
Highly Cited
1995
Highly Cited
1995
Lottery and stride scheduling: flexible proportional-share resource management
C. Waldspurger
1995
Corpus ID: 2405301
This thesis presents flexible abstractions for specifying resource management policies, together with efficient mechanisms for…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE