Conjecture about global fixed-priority preemptive multiprocessor scheduling of ...

• Author(s): Andersson, Björn
• Date: 2010
• Persistent ID: http://hdl.handle.net/10400.22/3912
• Origin: Repositório Científico do Instituto Politécnico do Porto
• Document Type: Report
• Language: English

Description

Consider global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks. I conjecture that the utilization bound of SM-US(√2−1) is √2-1.