38 search results - page 1 / 8 » Analysis of Round-Robin Implementations of Processor Sharing... |
NCA
2009
IEEE
13 years 11 months ago
2009
IEEE
—It has been observed in recent years that in many applications service time demands are highly variable. Without foreknowledge of exact service times of individual jobs, process...
SIGMETRICS
2008
ACM
13 years 4 months ago
2008
ACM
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
IWMM
2011
Springer
12 years 7 months ago
2011
Springer
Multiprocessors based on processors with multiple cores usually include a non-uniform memory architecture (NUMA); even current 2-processor systems with 8 cores exhibit non-uniform...
ASPLOS
1996
ACM
13 years 9 months ago
1996
ACM
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
PPOPP
2009
ACM
14 years 5 months 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...