Group-based Pfair Scheduling
ثبت نشده
چکیده
منابع مشابه
Supporting lock-free synchronization in Pfair-scheduled real-time systems
We consider the use of lock-free techniques for implementing shared objects in real-time Pfair-scheduled multiprocessor systems. Lockfree objects are more economical than locking techniques when implementing relatively simple objects such as buffers, stacks, queues, and lists. However, the use of such objects on real-time multiprocessors is generally considered impractical due to the need for a...
متن کاملMixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks
There has been much recent interest in multiprocessor Pfair and ERfair scheduling algorithms. Under Pfair scheduling, each task is broken into quantum-length subtasks, each of which must execute within a \window" of time slots. These windows divide each period of a task into potentially overlapping subintervals of approximately equal length. \Early-release" fair (ERfair) scheduling was recently...
متن کاملThe Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; this is mainly due to the fact that well-understood uniprocessor scheduling algorithms can be used on each processor. In recent years, global-scheduling algorithms based on the concept of “proportionate fairness” (Pfair...
متن کاملEarly-release fair scheduling
We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to optimally schedule periodic tasks on a multiprocessor system in polynomial time. However, ERfair scheduling di ers from Pfair scheduling in that it is work conserving. As a result, average job response times may be muc...
متن کاملPC-Fair: Fair Scheduling of Precedence-Constrained Periodic Tasks in Multiprocessor Systems
The Pfair scheduling algorithms are known to be optimal for scheduling periodic real-time tasks on multiprocessor systems. However, one of the limitations of most prior work on the Pfair scheduling is that precedence constraints among tasks are not considered. We thus propose a PC-Fair (PrecedenceConstrained Fair) scheduling algorithm to overcome this limitation. The novelty of our algorithm co...
متن کامل