Sciweavers

Share
PPOPP
2009
ACM

Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin

13 years 2 months ago
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable for multiprocessors. This problem is becoming increasingly severe as the hardware industry continues to produce larger scale multi-core processors. This paper presents Distributed Weighted Round-Robin (DWRR), a new scheduling algorithm that solves this problem. With distributed thread queues and small additional overhead to the underlying scheduler, DWRR achieves high efficiency and scalability. Besides conventional priorities, DWRR enables users to specify weights to threads and achieve accurate proportional CPU sharing with constant error bounds. DWRR operates in concert with existing scheduler policies targeting other system attributes, such as latency and throughput. As a result, it provides a practical solution for various production OSes. To demonstrate the versatility of DWRR, we have implemented it in L...
Tong Li, Dan P. Baumberger, Scott Hahn
Added 25 Nov 2009
Updated 25 Nov 2009
Type Conference
Year 2009
Where PPOPP
Authors Tong Li, Dan P. Baumberger, Scott Hahn
Comments (0)
books