AbstractWe give a comprehensive summary of our recent research on the feasibility problems for various types of hard-real-time preemptive task systems on one processor. We include results on periodic, sporadic, and hybrid task systems. While many of the results herein have appeared elsewhere, this is the first paper presenting a holistic view of the entire problem
The problem of scheduling a set of periodic-time-critical tasks on a single-processor computing syst...
A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon...
Real-time systems increasingly contain processing units with multiple cores. To use this additional ...
AbstractWe give a comprehensive summary of our recent research on the feasibility problems for vario...
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on ...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a...
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a...
Real time systems have been a major area of study for many years. Advancements in electronics, compu...
International audienceThe use of computers to control safety-critical real-time functions has increa...
AbstractWe consider the problem of non-preemptively scheduling periodic and sporadic task systems on...
Abstract—Deciding the feasibility of a sporadic task system on a preemptive uniprocessor is a centra...
We consider the problem of non-preemptively scheduling periodic and sporadic task systems on one pro...
Optimal online scheduling algorithms are known for sporadic task systems scheduled upon a single pro...
The problem of scheduling a set of periodic-time-critical tasks on a single-processor computing syst...
A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon...
Real-time systems increasingly contain processing units with multiple cores. To use this additional ...
AbstractWe give a comprehensive summary of our recent research on the feasibility problems for vario...
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on ...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even i...
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a...
We give the first algorithm for testing the feasibility of a system of sporadic real-time tasks on a...
Real time systems have been a major area of study for many years. Advancements in electronics, compu...
International audienceThe use of computers to control safety-critical real-time functions has increa...
AbstractWe consider the problem of non-preemptively scheduling periodic and sporadic task systems on...
Abstract—Deciding the feasibility of a sporadic task system on a preemptive uniprocessor is a centra...
We consider the problem of non-preemptively scheduling periodic and sporadic task systems on one pro...
Optimal online scheduling algorithms are known for sporadic task systems scheduled upon a single pro...
The problem of scheduling a set of periodic-time-critical tasks on a single-processor computing syst...
A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon...
Real-time systems increasingly contain processing units with multiple cores. To use this additional ...
DOI
Add to ORKG