Improvements in polynomial-time feasibility testing for EDF

Authors:
Alejandro Masrur;Sebastian Drössler;Georg Färber
Affiliations:
Technische Universität München, Germany;Technische Universität München, Germany;Technische Universität München, Germany
Venue:
Proceedings of the conference on Design, automation and test in Europe
Year:
2008

Citing 6
Cited 1

Improvement in feasibility testing for real-time tasks

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

Journal of the ACM (JACM)
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms

Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor

MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990
Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling

Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Measuring the Performance of Schedulability Tests

Real-Time Systems

Approximation techniques for response-time analysis of static-priority tasks

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniprocessors. Both proposed methods are proven, analytically and by means of an extensive experimental comparison, to be more accurate than known polynomial-time feasibility tests. Additionally, we show for a wide interval of practical processor utilization that one of these methods presents almost the same efficiency, in terms of accepted task sets, as the more complex pseudo-polynomial-time exact feasibility tests.