Partitioned Scheduling of Parallel Real-time Tasks on Multiprocessor Systems

International audienceIn this paper, we focus on the scheduling of periodic fork-join real-time tasks on multiprocessor systems. Parallel real-time tasks of fork-join model have strict parallel segments with no laxity. We propose a parti- tioned scheduling algorithm which increases the laxity of the parallel segments and therefore the schedula- bility of tasksets of this model. A similar algorithm has been proposed in the literature but it produces job migrations. Ours avoid 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 compared to the previous one