Optimal rate-based scheduling on multiprocessors
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A proportionate fair scheduling rule with good worst-case performance
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Interposed proportional sharing for a storage service utility
Proceedings of the joint international conference on Measurement and modeling of computer systems
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Desynchronized Pfair Scheduling on Multiprocessors
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Fair scheduling of dynamic task systems on multiprocessors
Journal of Systems and Software - Special issue: Parallel and distributed real-time systems
On distributed smooth scheduling
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
VSched: Mixing Batch And Interactive Virtual Machines Using Periodic Real-time Scheduling
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
Journal of Scheduling
Capturing OS expertise in an event type system: the Bossa experience
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Optimal rate-based scheduling on multiprocessors
Journal of Computer and System Sciences
Efficient scheduling of soft real-time applications on multiprocessors
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Adapting Pfair scheduling for symmetric multiprocessors
Journal of Embedded Computing - Cache exploitation in embedded systems
GMAC '09 Proceedings of the 6th international conference industry session on Grids meets autonomic computing
T-L plane-based real-time scheduling for homogeneous multiprocessors
Journal of Parallel and Distributed Computing
A technique to reduce preemption overhead in real-time multiprocessor task scheduling
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Hi-index | 0.00 |
Abstract: In this paper, we present Deadline Fair Scheduling (DFS), a proportionate-fair CPU scheduling algorithm for multiprocessor servers. A particular focus of our work is to investigate practical issues in instantiating proportionate-fair (P-fair) schedulers into conventional operating systems. We show via a simulation study that characteristics of conventional operating systems such as the asynchrony in scheduling multiple processors, frequent arrivals and departures of tasks, and variable quantum durations can cause proportionate-fair schedulers to become non-work-conserving. To overcome this drawback, we combine DFS with an auxiliary work-conserving scheduler to ensure work-conserving behavior at all times. We then propose techniques to account for processor affinities while scheduling tasks in multiprocessor environments. We implement the resulting scheduler in the Linux kernel and evaluate its performance using various applications and benchmarks. Our experimental results show that DFS can achieve proportionate allocation, performance isolation and work-conserving behavior at the expense of a small increase in the scheduling overhead. We conclude that practical considerations such as work-conserving behavior and processor affinities when incorporated into a P-fair scheduler such as DFS can result in a practical approach for scheduling tasks in a multiprocessor operating system.