437 search results - page 5 / 88 » Quincy: fair scheduling for distributed computing clusters |
ICDCS
2009
IEEE
15 years 8 months ago
2009
IEEE
A strongly fair schedule is one in which tasks that are enabled infinitely often are also executed infinitely often. When tasks execute atomically, a strongly fair scheduler can...
CLUSTER
2008
IEEE
14 years 11 months ago
2008
IEEE
CLUSTER
2007
IEEE
14 years 11 months ago
2007
IEEE
118
click to vote
HPDC
2006
IEEE
15 years 5 months ago
2006
IEEE
The aIOLi project aims at optimizing the I/O accesses within the cluster by providing a simple POSIX API, thus avoiding the constraints to use a dedicated parallel I/O library. Th...
PPOPP
2009
ACM
16 years 4 days ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...