The Partitioned Multiprocessor Scheduling of Deadline-Constrained Sporadic Task Systems

Authors:
Sanjoy Baruah;Nathan Fisher
Affiliations:
IEEE;IEEE
Venue:
IEEE Transactions on Computers
Year:
2006

Citing 8
Cited 11

Optimal time-critical scheduling via resource augmentation (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Efficient and flexible fair scheduling of real-time tasks on multiprocessors

Efficient and flexible fair scheduling of real-time tasks on multiprocessors
An Event Stream Driven Approximation for the Analysis of Real-Time Systems

ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
An Analysis of EDF Schedulability on a Multiprocessor

IEEE Transactions on Parallel and Distributed Systems
Improved Schedulability Analysis of EDF on Multiprocessor Platforms

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Task Assignment on Uniform Heterogeneous Multiprocessors

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems

The feasibility of general task systems with precedence constraints on multiprocessor platforms

Real-Time Systems
Optimal virtual cluster-based multiprocessor scheduling

Real-Time Systems
Partition oriented frame based fair scheduler

Journal of Parallel and Distributed Computing
On best-effort utility accrual real-time scheduling on multiprocessors

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

ACM SIGBED Review
Real-time scheduling on heterogeneous system-on-chip architectures using an optimised artificial neural network

Journal of Systems Architecture: the EUROMICRO Journal
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Sticky-ERfair: a task-processor affinity aware proportional fair scheduler

Real-Time Systems
Managing latency in embedded streaming applications under hard-real-time scheduling

Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Deadline and activation time assignment for partitioned real-time application on multiprocessor reservations

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	14.98

Visualization

Abstract

A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks, each constrained to have its relative-deadline parameter be no larger than its period parameter, among the processors of an identical multiprocessor platform. Since the partitioning problem is easily seen to be NP--hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterization of its worst-case performance is provided in terms of resource augmentation: It is shown that any set of sporadic tasks that can be partitioned among the processors of an m{\hbox{-}}{\rm processor} identical multiprocessor platform will be partitioned by this algorithm on an m{\hbox{-}}{\rm processor} platform in which each processor is (3-1/m) times as fast.