Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources

Authors:
Mark Moir;Srikanth Ramamurthy
Affiliations:
-;-
Venue:
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Year:
1999

Citing 0
Cited 25

A proportionate fair scheduling rule with good worst-case performance

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A theory of multi-channel schedulers for quality of service

Journal of High Speed Networks
Rate-monotonic scheduling on uniform multiprocessors

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks

Journal of Computer and System Sciences
Real Time Scheduling Theory: A Historical Perspective

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
Group-Based Pfair Scheduling

Real-Time Systems
The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors

Real-Time Systems
Locking under Pfair scheduling

ACM Transactions on Computer Systems (TOCS)
Supporting lock-free synchronization in Pfair-scheduled real-time systems

Journal of Parallel and Distributed Computing
Smooth scheduling under variable rates or the analog-digital confinement game

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
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
Evaluation of multi-core scheduling mechanisms for heterogeneous processing architectures

Proceedings of the 18th International Workshop on Network and Operating Systems Support for Digital Audio and Video
Push-assisted migration of real-time tasks in multi-core processors

Proceedings of the 2009 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Optimization scheduling of MPEG-4 FGS video coding stream under the feasible mandatory constraint

Multimedia Tools and Applications
Optimal virtual cluster-based multiprocessor scheduling

Real-Time Systems
A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

Real-Time Systems
Partition oriented frame based fair scheduler

Journal of Parallel and Distributed Computing
Scheduling periodic tasks on uniform multiprocessors

Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Predictable task migration for locked caches in multi-core systems

Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems
The generalized multiprocessor periodic resource interface model for hierarchical multiprocessor scheduling

Proceedings of the 20th International Conference on Real-Time and Network Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper concerns the problem of scheduling sets of preemptable, periodic tasks on multiple resources. We consider a task model that allows arbitrary mixes of fixed and migratable tasks, and prove the existence of an optimal pfair scheduler in this model. Fixed tasks must always be scheduled on a given resource, while migratable tasks can be scheduled on different resources at different times. A pfair scheduler produces a periodic schedule in which the times each task is allocated a processor are approximately evenly spread throughout its period. This work extends work of Baruah et al, who proved a similar result for systems in which all tasks are migratable.