Skip to Main content Skip to Navigation
Conference papers

Partitioned Scheduling of Parallel Real-time Tasks on Multiprocessor Systems

Abstract : In 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 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. 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Serge Midonnet Connect in order to contact the contributor
Submitted on : Tuesday, March 19, 2013 - 1:23:37 PM
Last modification on : Saturday, January 15, 2022 - 3:57:14 AM
Long-term archiving on: : Thursday, March 30, 2017 - 2:32:14 PM


Files produced by the author(s)


  • HAL Id : hal-00620398, version 1


Frédéric Fauberteau, Serge Midonnet, Manar Qamhieh. Partitioned Scheduling of Parallel Real-time Tasks on Multiprocessor Systems. 23rd Euromicro Conference on Real-Time Systems (ECRTS'11), 2011, United States. pp.1-4. ⟨hal-00620398⟩



Record views


Files downloads