Repository logo
 
Loading...
Thumbnail Image
Publication

The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%

Use this identifier to reference this record.
Name:Description:Size:Format: 
ART_BAndersson_2006_CISTER.pdf133.4 KBAdobe PDF Download

Advisor(s)

Abstract(s)

This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.

Description

Keywords

Real-time scheduling Partitioning Bin-packing algorithms Static-priority scheduling Preemptive scheduling Multiprocessors

Citation

Research Projects

Organizational Units

Journal Issue

Publisher

IOS Press

CC License

Altmetrics