A survey of hard real-time scheduling for multiprocessor systems
This survey covers hard real-time scheduling algorithms and schedulability analysis
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …
Measuring the performance of schedulability tests
E Bini, GC Buttazzo - Real-time systems, 2005 - Springer
The high computational complexity required for performing an exact schedulability analysis
of fixed priority systems has led the research community to investigate new feasibility tests …
of fixed priority systems has led the research community to investigate new feasibility tests …
Real time scheduling theory: A historical perspective
In this 25th year anniversary paper for the IEEE Real Time Systems Symposium, we review
the key results in real-time scheduling theory and the historical events that led to the …
the key results in real-time scheduling theory and the historical events that led to the …
Energy-aware partitioning for multiprocessor real-time systems
H Aydin, Q Yang - Proceedings International Parallel and …, 2003 - ieeexplore.ieee.org
In this paper, we address the problem of partitioning periodic real-time tasks in a
multiprocessor platform by considering both feasibility and energy-awareness perspectives …
multiprocessor platform by considering both feasibility and energy-awareness perspectives …
Static-priority scheduling on multiprocessors
B Andersson, S Baruah… - Proceedings 22nd IEEE …, 2001 - ieeexplore.ieee.org
The preemptive scheduling of systems of periodic tasks on a platform comprised of several
identical processors is considered. A scheduling algorithm is proposed for static-priority …
identical processors is considered. A scheduling algorithm is proposed for static-priority …
Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip
The research on real-time software systems has produced algorithms that allow to effectively
schedule system resources while guaranteeing the deadlines of the application and to …
schedule system resources while guaranteeing the deadlines of the application and to …
Utilization bounds for EDF scheduling on real-time multiprocessor systems
JM López, JL Díaz, DF García - Real-Time Systems, 2004 - Springer
The utilization bound for earliest deadline first (EDF) scheduling is extended from
uniprocessors to homogeneous multiprocessor systems with partitioning strategies. First …
uniprocessors to homogeneous multiprocessor systems with partitioning strategies. First …
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems
JM López, M García, JL Diaz… - … Euromicro Conference on …, 2000 - ieeexplore.ieee.org
Presents the utilization bound for earliest deadline first (EDF) scheduling on homogeneous
multiprocessor systems with partitioning strategies. Assuming that tasks are pre-emptively …
multiprocessor systems with partitioning strategies. Assuming that tasks are pre-emptively …
Biasing effects in schedulability measures
E Bini, GC Buttazzo - … 16th Euromicro Conference on Real-Time …, 2004 - ieeexplore.ieee.org
The performance of a schedulabilty test is typically evaluated by generating a huge number
of synthetic task sets and then computing the fraction of those that pass the test with respect …
of synthetic task sets and then computing the fraction of those that pass the test with respect …
Multisource software on multicore automotive ECUs—Combining runnable sequencing with task scheduling
As the demand for computing power is quickly increasing in the automotive domain, car
manufacturers and tier-one suppliers are gradually introducing multicore electronic control …
manufacturers and tier-one suppliers are gradually introducing multicore electronic control …