Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
Real-Time Systems
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Validating timing constraints in multiprocessor and distributed systems
Validating timing constraints in multiprocessor and distributed systems
Edf scheduling on heterogeneous multiprocessors
Edf scheduling on heterogeneous multiprocessors
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Sustainable Multiprocessor Scheduling of Sporadic Task Systems
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
In this paper, we focus on the static-priority scheduling of periodic hard real-time tasks upon identical multiprocessor platforms. In order to bound the inter-processor migrations, we consider the restricted-migration scheduling policy for which a task is allowed to migrate only at job boundaries. Several jobs of the same task can then be assigned on different processors but a given job can not migrate. It has been shown that this scheduling policy can suffer from scheduling anomalies. These anomalies occur when a decrease in execution requirement of a job causes a deadline miss. We present a static-priority restricted-migration scheduling algorithm and we prove it does not suffer from these anomalies. We also review the scheduling anomalies according to the scheduling tests for this algorithm.