Revisiting the Schedule Graph Generation for the Exact and Sustainable Analysis of Non-preemptive Scheduling
Distributed, Parallel, and Cluster Computing
2024-11-05 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2411.00877,
title = {Revisiting the Schedule Graph Generation for the Exact and Sustainable Analysis of Non-preemptive Scheduling},
author = {Marek Vlk and Marek Jaros and Zdenek Hanzalek},
journal= {arXiv preprint arXiv:2411.00877},
year = {2024}
}