Skip to Main content Skip to Navigation
Conference papers

Performance Analysis for Segment Stretch Transformation of Parallel Real-time Tasks

Abstract : The Segment Stretch Transformation (SST) is an algorithm that transforms parallel Fork-Join (FJ) tasks into sequential tasks on multiprocessor systems when possible, in order to increase the schedulability of the tasksets of this model. SST is based on Task Stretch Transformation (TST) which is a transformation for the same model of tasks, but it uses segment migrations while SST eliminates their use. In this paper, we prove that SST transformation has the same performance of TST transformation by providing a detailed analysis based on Demand Bound Function (DBF) and by showing that SST has a resource augmentation bound of 3.42, same as TST, which means that if a taskset is feasible on m speed processors, then it is schedulable using the transformation on m processors that are 3.42 times faster.
Document type :
Conference papers
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Manar Qamhieh Connect in order to contact the contributor
Submitted on : Wednesday, May 9, 2012 - 11:52:58 PM
Last modification on : Thursday, September 29, 2022 - 2:21:15 PM
Long-term archiving on: : Thursday, December 15, 2016 - 5:31:22 AM


Files produced by the author(s)


  • HAL Id : hal-00695817, version 1


Manar Qamhieh, Frédéric Fauberteau, Serge Midonnet. Performance Analysis for Segment Stretch Transformation of Parallel Real-time Tasks. 5th Junior Researcher Workshop on Real-Time Computing (JRWRTC 2011), Sep 2011, Nantes, France, France. pp.29-32. ⟨hal-00695817⟩



Record views


Files downloads