Non-work-conserving scheduling of non-preemptive hard real-time tasks based on fixed priorities

Mitra Nasri, Gerhard Fohler

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

7 Citaten (Scopus)

Samenvatting

In this paper, we consider scheduling of non-preemptive and independent periodic tasks with implicit deadlines on uniprocessor systems. We assume loose-harmonic task sets with periods being integer multiples of the smallest period. This problem is known to be NP-Hard. Recently, two online non-work-conserving scheduling algorithms called Precautious-RM (P-RM) and lazy P-RM (LP-RM) have been introduced to guarantee schedulability of special cases of harmonic task sets. In this paper, we provide new sufficient schedulability tests for P-RM and LP-RM. Then, by introducing a new algorithm called efficient Precautious-RM (EP-RM), we increase the number of schedulable loose-harmonic task sets in comparison with P-RM by letting the tasks share the priorities. We prove that the new test dominates the schedula-bility tests for P-RM. Moreover, we show that if the ratio of two consecutive periods is greater than or equal to 3, P-RM, LP-RM, and EP-RM are able to schedule any task set satisfying the necessary conditions of schedulability. We present results from a simulation study, showing the efficiency of the algorithm.

Originele taal-2Engels
TitelProceedings of the 23rd International Conference on Real Time Networks and Systems, RTNS 2015
UitgeverijAssociation for Computing Machinery, Inc.
Pagina's309-318
Aantal pagina's10
ISBN van elektronische versie978-1-4503-3591-1
DOI's
StatusGepubliceerd - nov. 2015
Extern gepubliceerdJa
Evenement23rd International Conference on Real-Time Networks and Systems, RTNS 2015 - Lille, Frankrijk
Duur: 4 nov. 20156 nov. 2015
Congresnummer: 23

Congres

Congres23rd International Conference on Real-Time Networks and Systems, RTNS 2015
Verkorte titelRTNS 2015
Land/RegioFrankrijk
StadLille
Periode4/11/156/11/15
AnderRTNS 2015

Bibliografische nota

Publisher Copyright:
© 2015 ACM.

Vingerafdruk

Duik in de onderzoeksthema's van 'Non-work-conserving scheduling of non-preemptive hard real-time tasks based on fixed priorities'. Samen vormen ze een unieke vingerafdruk.

Citeer dit