Sufficient FTP Schedulability Test for the Non-Cyclic Generalized
  Multiframe Task Model

Berten, Vandy; Goossens, Joël

Record: found
Abstract: found
Article: found

Is Open Access

Sufficient FTP Schedulability Test for the Non-Cyclic Generalized Multiframe Task Model

Preprint

Author(s): Vandy Berten , Joël Goossens

Publication date Created: 26 October 2011

Read this article at

ScienceOpen ArXiv

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Abstract

Our goal is to provide a sufficient schedulability test -ideally polynomial- for the scheduling of Non-Cyclic Generalized Multiframe Task Model using Fixed-Task-Priority schedulers. We report two first results: (i) we present and prove correct the critical instant for the Non-Cyclic Generalized Multiframe Task Model then (ii) we propose an algorithm which provides a sufficient (but pseudo-polynomial) schedulability test.