arXiv Open Access 2010

Gang FTP scheduling of periodic and parallel rigid real-time tasks

Joël Goossens Vandy Berten

Lihat Sumber

Abstrak

In this paper we consider the scheduling of periodic and parallel rigid tasks. We provide (and prove correct) an exact schedulability test for Fixed Task Priority (FTP) Gang scheduler sub-classes: Parallelism Monotonic, Idling, Limited Gang, and Limited Slack Reclaiming. Additionally, we study the predictability of our schedulers: we show that Gang FJP schedulers are not predictable and we identify several sub-classes which are actually predictable. Moreover, we extend the definition of rigid, moldable and malleable jobs to recurrent tasks.

Topik & Kata Kunci

cs.OS

Penulis (2)

Joël Goossens

Vandy Berten

Format Sitasi

APA MLA BibTeX

Goossens, J., Berten, V. (2010). Gang FTP scheduling of periodic and parallel rigid real-time tasks. https://arxiv.org/abs/1006.2617

Akses Cepat

Lihat di Sumber

Informasi Jurnal

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