Portable RK: A Portable Resource Kernel for Guaranteed and Enforced Timing Behavior
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
Biasing Effects in Schedulability Measures
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Gang EDF Scheduling of Parallel Task Systems
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Scheduling Parallel Real-Time Tasks on Multi-core Processors
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Hi-index | 0.00 |
In this paper, we focus on the scheduling of periodic fork-join real-time tasks on multiprocessor systems. Parallel real-time tasks in the fork-join model have strict parallel segments without laxity. We propose a partitioned scheduling algorithm which increases the laxity of the parallel segments and therefore the schedulability of tasksets of this model. A similar algorithm has been proposed in the literature but it produces job migrations. Our algorithm eliminates the use of job migrations in order to create a portable algorithm that can be implemented on a standard Linux kernel. Results of extensive simulations are provided in order to analyze the schedulability of the proposed algorithm, and to provide comparisons with the other algorithm proposed in the literature.