The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities

Authors:
Nathan Fisher;Sanjoy Baruah;Theodore P. Baker
Affiliations:
University of North Carolina at Chapel Hill;University of North Carolina at Chapel Hill;Florida State University
Venue:
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Year:
2006

Citing 0
Cited 11

The partitioned dynamic-priority scheduling of sporadic task systems

Real-Time Systems
Schedulability analysis of global EDF

Real-Time Systems
Deadline Monotonic Scheduling on Uniform Multiprocessors

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Power-Aware Real-Time Scheduling upon Dual CPU Type Multiprocessor Platforms

OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Optimal virtual cluster-based multiprocessor scheduling

Real-Time Systems
Allowance-Fit: a partitioning algorithm for temporal robustness of hard real-time systems upon multiprocessors

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Partitioned scheduling of parallel real-time tasks on multiprocessor systems

ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
Assigning sporadic tasks to unrelated parallel machines

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Design of safety-critical Java level 1 applications using affine abstract clocks

Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
Parallel scheduling for cyber-physical systems: analysis and case study on a self-driving car

Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduling on each individual processor. Since the partitioning problem is easily seen to be NP-hard in the strong sense, this algorithm is not optimal. A quantitative characterization of its worst-case performance is provided in terms of sufficient conditions and resource augmentation approximation bounds. The partitioning algorithm is also evaluated over randomly generated task systems.