Preemptive uniprocessor scheduling of non-cyclic GMF task systems

  • Sanjoy Baruah

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

Formal models used for representing recurrent real-time processes are typically characterized by a period parameter, representing the minimum amount of time that may elapse between successive invocations of the process. However a recently proposed model called the non-cyclic GMF model deviates from this trend: there is no single period parameter characterizing the recurrent behavior of the task. In this paper we consider schedulability analysis of real-time systems comprised of collections of such tasks, that are to be scheduled using earliest-deadline first (EDF) scheduling on a single preemptive processor. We provide evidence that indicates that schedulability analysis for such systems is more difficult than for systems in which each recurrent task is characterized by a single period parameter, and derive a pseudo-polynomial time schedulability analysis algorithm for bounded-utilization systems of such tasks.

Original languageEnglish
Title of host publicationProceedings - 16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2010
Pages195-202
Number of pages8
DOIs
StatePublished - 2010
Event16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2010 - Macau, China
Duration: Aug 23 2010Aug 25 2010

Publication series

NameProceedings - 16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2010

Conference

Conference16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2010
Country/TerritoryChina
CityMacau
Period08/23/1008/25/10

Fingerprint

Dive into the research topics of 'Preemptive uniprocessor scheduling of non-cyclic GMF task systems'. Together they form a unique fingerprint.

Cite this