Guaranteeing Pfair Supertasks by Reweighting

Authors:
Philip Holman;James H. Anderson
Affiliations:
-;-
Venue:
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Year:
2001

Citing 0
Cited 9

Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
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
Supporting lock-free synchronization in Pfair-scheduled real-time systems

Journal of Parallel and Distributed Computing
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
Optimal virtual cluster-based multiprocessor scheduling

Real-Time Systems
Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

We reconsider the "supertask" approach, in which a setof Pfair tasks is scheduled as a single task.We define a"safe" weight threshold for a given supertask in a multiprocessor system with either hard or soft deadlinesand either strict or relaxed rate constraints.