Revisiting the Schedule Graph Generation for the Exact and Sustainable Analysis of Non-preemptive Scheduling
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909375729238016 |
|---|---|
| author | Vlk, Marek Jaros, Marek Hanzalek, Zdenek |
| author_facet | Vlk, Marek Jaros, Marek Hanzalek, Zdenek |
| contents | This paper addresses the problem of scheduling non-preemptive tasks with release jitter and execution time variation on a uniprocessor. We show that the schedulability analysis based on schedule graph generation, proposed by Nasri and Brandenburg [RTSS 2017], produces negative results when it could be easily avoided by slightly reformalizing the notion of non-work-conserving policies. In this work, we develop a schedulability analysis that constructs the schedule graph using new job-eligibility rules and is exact and sustainable for both work-conserving and enhanced formalization of non-work-conserving policies. Besides, the experimental evaluation shows that our schedulability analysis is substantially faster. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_00877 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Revisiting the Schedule Graph Generation for the Exact and Sustainable Analysis of Non-preemptive Scheduling Vlk, Marek Jaros, Marek Hanzalek, Zdenek Distributed, Parallel, and Cluster Computing This paper addresses the problem of scheduling non-preemptive tasks with release jitter and execution time variation on a uniprocessor. We show that the schedulability analysis based on schedule graph generation, proposed by Nasri and Brandenburg [RTSS 2017], produces negative results when it could be easily avoided by slightly reformalizing the notion of non-work-conserving policies. In this work, we develop a schedulability analysis that constructs the schedule graph using new job-eligibility rules and is exact and sustainable for both work-conserving and enhanced formalization of non-work-conserving policies. Besides, the experimental evaluation shows that our schedulability analysis is substantially faster. |
| title | Revisiting the Schedule Graph Generation for the Exact and Sustainable Analysis of Non-preemptive Scheduling |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2411.00877 |