Conjecture about global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks: The utilization bound of SM-US(sqrt(2)-1) is sqrt(2)-1
Ref: HURRAY-TR-100512 Publication Date: 6, Jul, 2010
Conjecture about global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks: The utilization bound of SM-US(sqrt(2)-1) is sqrt(2)-1
Ref: HURRAY-TR-100512 Publication Date: 6, Jul, 2010Abstract:
Consider global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks. I conjecture that the utilization bound of SM-US(sqrt(2)-1) is sqrt(2)-1.
Björn AnderssonDocument:
View
Download1st International Real-Time Scheduling Open Problems Seminar (RTSOPS 2010).
Brussels, Belgium.
Notes: In conjunction with the 22th Euromicro Intl Conference on Real-Time Systems
Record Date: 29, May, 2010
Short links for this page: www.cister.isep.pt/docs/hurray_tr_100512 www.cister.isep.pt/docs/565