(m,k)-firm constraints and DBP scheduling: impact of the initial k-sequence and exact schedulability test
| dc.creator | Goossens, Joël | |
| dc.date | 2008-05-02 | |
| dc.date | 2008-09-08 | |
| dc.date.accessioned | 2026-07-07T10:00:54Z | |
| dc.date.available | 2026-07-07T10:00:54Z | |
| dc.description | In this paper we study the scheduling of (m,k)-firm synchronous periodic task systems using the Distance Based Priority (DBP) scheduler. We first show three phenomena: (i) choosing, for each task, the initial k-sequence 1^k is not optimal, (ii) we can even start the scheduling from a (fictive) error state (in regard to the initial k-sequence) and (iii) the period of feasible DBP-schedules is not necessarily the task hyper-period. We then show that any feasible DBP-schedule is periodic and we upper-bound the length of that period. Lastly, based on our periodicity result we provide an exact schedulability test. | |
| dc.identifier | https://arxiv.org/abs/0805.0200 | |
| dc.identifier | http://arxiv.org/abs/0805.0200 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/168462 | |
| dc.subject | Operating Systems | |
| dc.title | (m,k)-firm constraints and DBP scheduling: impact of the initial k-sequence and exact schedulability test | |
| dc.type | text |