Feasibility analysis of sporadic real-time multiprocessor task systems

Authors:
Vincenzo Bonifaci;Alberto Marchetti-Spaccamela
Affiliations:
Max-Planck Institut für Informatik, Saarbrücken, Germany;Sapienza Università di Roma, Rome, Italy
Venue:
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Year:
2010

Citing 7
Cited 1

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

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

Journal of the ACM (JACM)
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed 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
Open problems in real-time scheduling

Journal of Scheduling

Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a set of identical processors, solving an open problem in the area of multiprocessor real-time scheduling [S. Baruah and K. Pruhs, Journal of Scheduling, 2009]. We also investigate the related notion of schedulability and a notion that we call online feasibility. Finally, we show that discrete-time schedules are as powerful as continuous-time schedules, which answers another open question in the above mentioned survey.