Algorithms for Determining the Demand-Based Load of a Sporadic Task System

Authors:
Nathan Fisher;Theodore P. Baker;Sanjoy Baruah
Affiliations:
The University of North Carolina at Chapel Hill, USA;Florida State University, USA;The University of North Carolina at Chapel Hill, USA
Venue:
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2006

Citing 0
Cited 12

Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems

Real-Time Systems
Schedulability analysis of global EDF

Real-Time Systems
A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm

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
An analysis of global edf schedulability for arbitrary-deadline sporadic task systems

Real-Time Systems
Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Global fixed-priority scheduling of arbitrary-deadline sporadic task systems

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Tests for global EDF schedulability analysis

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
Thermal-aware global real-time scheduling and analysis on multicore systems

Journal of Systems Architecture: the EUROMICRO Journal
Implementation and evaluation of mixed-criticality scheduling approaches for sporadic tasks

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The load parameter of a sporadic task system is defined to be the largest possible cumulative execution requirement that can be generated by jobs of the task system over any time interval, normalized by the length of the interval. This parameter is known to play a very important role in the uniprocessor feasibility analysis of sporadic task systems. In this paper, it is shown that the load of a sporadic task system may be used as an accurate indicator of its feasibility upon preemptive multiprocessors as well. Exact algorithms, and approximate ones that can be guaranteed to be accurate to within an arbitrary additive error gt 0, for computing a task system's load are presented and proven correct. The performance of these algorithms is evaluated by simulation over randomly generated task systems.