A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling

Authors:
Vincenzo Bonifaci;Alberto Marchetti-Spaccamela;Sebastian Stiller
Affiliations:
Sapienza Università di Roma, Italy and Università degli Studi dell'Aquila, Italy;Sapienza Università di Roma, Italy;Technische Universität Berlin, Germany
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 8
Cited 5

Feasibility problems for recurring tasks on one processor

MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
Trade-offs between speed and processor in hard-deadline scheduling

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Approximate Schedulability Analysis

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
An Event Stream Driven Approximation for the Analysis of Real-Time Systems

ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling

Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
An Analysis of EDF Schedulability on a Multiprocessor

IEEE Transactions on Parallel and Distributed Systems
A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines

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

Improved multiprocessor global schedulability analysis

Real-Time Systems
EDF-schedulability of synchronous periodic task systems is coNP-hard

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and complexity for periodic real-time scheduling

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Open problems in real-time scheduling

Journal of Scheduling
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and 茂戮驴 0, correctly decides either that the task system can be scheduled using the earliest deadline first algorithm on mspeed-(2 茂戮驴 1/m+ 茂戮驴) machines, or that the system is infeasible for mspeed-1 machines. The running time of the algorithm is polynomial in the size of the task system and 1/茂戮驴. We also provide an improved bound trading off speed for additional machines.Our analysis relies on a new concept for counting the workload of an interval, that might also turn useful for analyzing other types of task systems.