Minimum and Maximum Utilization Bounds for Multiprocessor RM Scheduling

Authors:
J. M. López;J. L. Díaz;D. F. García
Affiliations:
-;-;-
Venue:
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Year:
2001

Citing 0
Cited 8

Preemptive Multiprocessor Scheduling Anomalies

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Real Time Scheduling Theory: A Historical Perspective

Real-Time Systems
An Analysis of Fixed-Priority Schedulability on a Multiprocessor

Real-Time 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
Dynamic repartitioning of real-time schedule on a multicore processor for energy efficiency

EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Overload provisioning in mixed-criticality cyber-physical systems

ACM Transactions on Embedded Computing Systems (TECS)
Energy and transition-aware runtime task scheduling for multicore processors

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: This paper deals with the problem of finding utilization bounds for multiprocessor Rate Monotonic scheduling with partitioning. The minimum and maximum utilization bounds among all the reasonable allocation algorithms are calculated. We prove that the utilization bound associated with the reasonable allocation heuristic Worst Fit (WF) is equal to that minimum. In addition, we prove that the utilization bound associated with the heuristics First Fit Decreasing (FFD) and Best Fit Decreasing (BFD) is equal to the maximum, of value (n + 1)(21/2-1),where n is the number of processors.