Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%

Authors:
Björn Andersson
Affiliations:
IPP Hurray Research Group, Polytechnic Institute of Porto, Portugal
Venue:
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Year:
2008

Citing 9
Cited 5

POSIX.4: programming for the real world

POSIX.4: programming for the real world
Optimal time-critical scheduling via resource augmentation (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Utilization Bounds for N-Processor Rate MonotoneScheduling with Static Processor Assignment

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Analyzing Fixed-Priority Global Multiprocessor Scheduling

RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
Static-Priority Scheduling on Multiprocessors

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
An Analysis of Fixed-Priority Schedulability on a Multiprocessor

Real-Time Systems
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms

RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Real-Time Systems
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
What to make of multicore processors for reliable real-time systems?

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Partially non-preemptive dual priority multiprocessor scheduling

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.01

Visualization

Abstract

Consider the problem of scheduling real-time tasks on a multiprocessor with the goal of meeting deadlines. Tasks arrive sporadically and have implicit deadlines, that is, the deadline of a task is equal to its minimum inter-arrival time. Consider this problem to be solved with global static-priority scheduling. We present a priority-assignment scheme with the property that if at most 38% of the processing capacity is requested then all deadlines are met.