Feasibility Analysis of Real-Time Periodic Tasks with Offsets

Authors:
Rodolfo Pellizzoni;Giuseppe Lipari
Affiliations:
Scuola Superiore S. Anna, Pisa, Italy;Scuola Superiore S. Anna, Pisa, Italy
Venue:
Real-Time Systems
Year:
2005

Citing 9
Cited 4

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
Dynamic priority ceilings: a concurrency control protocol for real-time systems

Real-Time Systems
Stack-based scheduling for realtime processes

Real-Time Systems
An extendible approach for analyzing fixed priority hard real-time tasks

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

Journal of the ACM (JACM)
Schedulability analysis of periodic and aperiodic tasks with resource constraints

Journal of Systems Architecture: the EUROMICRO Journal - Special issue on real-time systems
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Scheduling Periodic Task Systems to Minimize Output Jitter

RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Improved Schedulability Analysis of Real-Time Transactions with Earliest Deadline Scheduling

RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium

Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling

Journal of Computer and System Sciences
Resource holding times: computation and optimization

Real-Time Systems
Feasibility analysis of real-time transactions

Real-Time Systems
Optimal procrastination interval for constrained deadline sporadic tasks upon uniprocessors

Proceedings of the 21st International conference on Real-Time Networks and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of feasibility analysis of asynchronous periodic task sets, where tasks can have an initial offset, is known to be co-NP-complete in the strong sense. A sufficient pseudo-polynomial test has been proposed by Baruah, Howell and Rosier, which consists in analyzing the feasibility of the corresponding synchronous task set (i.e. all offsets are set equal to 0). If the test gives a positive result, then the original asynchronous task set is feasible; else, no definitive answer can be given. In many cases, this sufficient test is too pessimistic, i.e. it gives no response for many feasible task sets.In this paper, we present a new sufficient pseudo-polynomial test for asynchronous periodic task sets. Our test reduces the pessimism by explicitely considering the offsets in deriving a small set of critical arrival patterns. We show, trough a set of extensive simulations, that our test outperforms the previous sufficient test.