Notional Processors: An Approach for Multiprocessor Scheduling

Authors:
Konstantinos Bletsas;Björn Andersson
Affiliations:
-;-
Venue:
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Year:
2009

Citing 0
Cited 8

A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Real-Time Systems
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

Real-Time Systems
Implementing multicore real-time scheduling algorithms based on task splitting using ada 2012

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Real-time scheduling with resource sharing on uniform multiprocessors

Proceedings of the 20th International Conference on Real-Time and Network Systems
Enhancing the real-time capabilities of the Linux kernel

ACM SIGBED Review - Special Issue on the 24th Euromicro Conference on Real-Time Systems
Real-time scheduling with resource sharing on heterogeneous multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider the problem of designing an algorithm with a high utilization bound for scheduling sporadic tasks with implicit deadlines on identical processors. A task is characterized by its minimum interarrival time and its execution time. Task preemption and migration is permitted. Still, low preemption and migration counts are desirable.We formulate an algorithm with a utilization bound no less than 66.6%characterized by worst-case preemption counts comparing favorably against the state-of-the-art.