The Community for Technology Leaders
Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000 (2000)
Stockholm, Sweden
June 19, 2000 to June 21, 2000
ISSN: 1068-3070
ISBN: 0-7695-0734-4
pp: 25
J.M. López , University of Oviedo
M. García , University of Oviedo
J.L. Díaz , University of Oviedo
D.F. García , University of Oviedo
In this paper, we present the utilization bound for Earliest Deadline First (EDF) scheduling on homogeneous multiprocessor systems with partitioning strategies. Assuming that tasks are preemptively scheduled on each processor according to the EDF algorithm, and allocated according to the First Fit (FF) heuristic, we prove that the worst-case achievable utilization is 0.5(n+1), where n is the number of processors. This bound is valid for arbitrary utilization factors. Moreover, if all the tasks have utilization factors under a value alpha, the previous bound is raised, and the new utilization bound considering alpha is calculated. In addition, we prove that no pair of uniprocessor scheduling algorithm-allocation algorithm can provide a higher worst-case achievable utilization than that of EDF-FF. Finally, simulation provides the average-case achievable utilization for EDF-FF.
Multiprocessor scheduling, EDF with partitioning, utilization bounds

J. Díaz, M. García, J. López and D. García, "Worst-Case Utilization Bound for EDF Scheduling on Real-Time Multiprocessor Systems," Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000(ECRTS), Stockholm, Sweden, 2000, pp. 25.
93 ms
(Ver 3.3 (11022016))