Pfair scheduling: beyond periodic task systems

Authors:
James H. Anderson;A. Srinivasan
Affiliations:
-;-
Venue:
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Year:
2000

Citing 0
Cited 25

Optimal rate-based scheduling on multiprocessors

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
Desynchronized Pfair Scheduling on Multiprocessors

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Task Reweighting on Multiprocessors: Efficiency versus Accuracy

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
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
The Granularity Metric for Fine-Grain Real-Time Scheduling

IEEE Transactions on Computers
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
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)
A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm

Real-Time Systems
Improved conditions for bounded tardiness under EPDF Pfair multiprocessor scheduling

Journal of Computer and System Sciences
Real-time scheduling of divisible loads in cluster computing environments

Journal of Parallel and Distributed Computing
Enhanced real-time divisible load scheduling with different processor available times

HiPC'07 Proceedings of the 14th international conference on High performance computing
Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Real-time scheduling using regularity criteria and a geometrical approach

International Journal of Critical Computer-Based Systems
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
Scheduling real-time divisible loads with advance reservations

Real-Time Systems
Efficient real-time divisible load scheduling

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider variants of Pfair and ER-fair scheduling in which subtasks may be released late, i.e., there may be separation between consecutive windows of the same task. We call such tasks intra-sporadic tasks. There are two main contributions. First, we show the existence of a Pfair (and hence ER-fair) schedule for any intra-sporadic task system whose utilization is at most the number of available processors. Second, we give a polynomial-time algorithm that is optimal for scheduling intra-sporadic tasks in a Pfair or ER-fair manner on systems of one or two processors.