Utilization Bounds for RM Scheduling on Uniform Multiprocessors

Authors:
Vivek N. Darera;Lawrence Jenkins
Affiliations:
Indian Institute of Science, India;Indian Institute of Science, India
Venue:
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2006

Citing 0
Cited 3

Deadline Monotonic Scheduling on Uniform Multiprocessors

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Task assignment algorithms for two-type heterogeneous multiprocessors

Real-Time Systems
Real-time scheduling with resource sharing on heterogeneous multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Utilization bounds for Earliest Deadline First(EDF) and Rate Monotonic(RM) scheduling are known and well understood for uniprocessor systems. In this paper, we derive limits on similar bounds for the multiprocessor case, when the individual processors need not be identical. Tasks are partitioned among the processors and RM scheduling is assumed to be the policy used in individual processors. A minimum limit on the bounds for a 'greedy' class of algorithms is given and proved, since the actual value of the bound depends on the algorithm that allocates the tasks. We also derive the utilization bound of an algorithm which allocates tasks in decreasing order of utilization factors. Knowledge of such bounds allows us to carry out very fast schedulability tests although we are constrained by the fact that the tests are sufficient but not necessary to ensure schedulability.