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

Andersson, Björn

http://hdl.handle.net/10400.22/3912

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
REL_BjornAndersson_2010_CISTER.pdf		236.38 KB	Adobe PDF	Download

Send Feedback

Authors

Andersson, Björn

Abstract(s)

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.

URI

http://hdl.handle.net/10400.22/3912

Publisher

IPP Hurray! Research Group

Collections

ISEP – CISTER – Relatórios

Full item page

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

Authors

Advisor(s)

Abstract(s)

Description

Keywords

URI

Pedagogical Context

Citation

Research Projects

Organizational Units

Journal Issue

Publisher

Collections

CC License