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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
In this paper, we describe an extension of the Linux kernel scheduler called the Practical Fair-Share Scheduler (PFS). PFS is a… (More)
  • figure 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A system based on orthogonal frequency division multiple access (OFDMA) has been developed to deliver mobile broadband data… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate… (More)
  • figure 6
Is this relevant?
2000
2000
Fair share scheduling is a way to guarantee application performance by explicitly allocating shares of system resources among… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper, we present surplus fair scheduling (SFS), a proportional-share CPU scheduler designed for symmetric… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like conventional Pfair… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Fair scheduling of delay and rate-sensitive packet ows over a wireless channel is not addressed e ectively by most contemporary… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 6
Is this relevant?