arXiv Open Access 2011

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

Vandy Berten Joël Goossens

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.OS

Penulis (2)

Vandy Berten

Joël Goossens

Format Sitasi

APA MLA BibTeX

Berten, V., Goossens, J. (2011). Sufficient FTP Schedulability Test for the Non-Cyclic Generalized Multiframe Task Model. https://arxiv.org/abs/1110.5793

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2011
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓