Work

Extending Periodic Task Sets with Sporadic Tasks: Computational Complexity and Exact Feasibility Tests

Year: 2025

Type: article

Abstract: Given a periodic task system that is guaranteed to be schedu-lable upon a preemptive uniprocessor, this paper addresses the problemof determining whether schedulability is preserved upon the addition of aset of sporadic tasks. The precise computational complexity of the prob-lem is established, and exact tests are designed, formally proven correct,and evaluated experimentally to assess their practicality for runtime de-ployment.

Source: Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)

Authors: Alkoudsi, Ibrahim, Baruah, Sanjoy, Ekberg, Pontus, Fohler, Gerhard, Goossens, Joël, Moslehi, Maryam

Language: English

Topic: Real-Time Systems Scheduling

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7112423858

FWCI:

Cites:

Cited by:

Related to: