loading...
Minimum and Maximum Utilization Bounds for Multiprocessor RM Scheduling
Delft, The Netherlands June 13-June 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EMRTS.2001.93400313th Euromicro Conference on Real-Tim ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
J.M. López, University of Oviedo
J.L. Díaz, University of Oviedo
D.F. García, University of Oviedo
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.
Citation:
J.M. López, J.L. Díaz, D.F. García, "Minimum and Maximum Utilization Bounds for Multiprocessor RM Scheduling," ecrts, pp.0067, 13th Euromicro Conference on Real-Time Systems (ECRTS'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.