Partitioned scheduling of parallel real-time tasks on multiprocessor systems

  • Authors:
  • Frédéric Fauberteau;Serge Midonnet;Manar Qamhieh

  • Affiliations:
  • Université Paris-Est, LIGM, UMR CNRS;Université Paris-Est, LIGM, UMR CNRS;Université Paris-Est, LIGM, UMR CNRS and ECE

  • Venue:
  • ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.