Polynomial Exact Schedulability and Infeasibility Test for Fixed-Priority Scheduling on Multiprocessor Platforms
Guardado en:
| Publicado en: | Applied System Innovation vol. 8, no. 1 (2025), p. 15 |
|---|---|
| Autor principal: | |
| Otros Autores: | , |
| Publicado: |
MDPI AG
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text + Graphics Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3170915744 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2571-5577 | ||
| 024 | 7 | |a 10.3390/asi8010015 |2 doi | |
| 035 | |a 3170915744 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 100 | 1 | |a Garanina, Natalia | |
| 245 | 1 | |a Polynomial Exact Schedulability and Infeasibility Test for Fixed-Priority Scheduling on Multiprocessor Platforms | |
| 260 | |b MDPI AG |c 2025 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a In this paper, we develop an exact schedulability test and sufficient infeasibility test for fixed-priority scheduling on multiprocessor platforms. We base our tests on presenting real-time systems as a Kripke model for dynamic real-time systems with sporadic non-preemptible tasks running on a multiprocessor platform and an online scheduler using global fixed priorities. This model includes states and transitions between these states, allows us to formally justify a polynomial-time algorithm for an exact schedulability test using the idea of backward reachability. Using this algorithm, we perform the exact schedulability test for the above real-time systems, in which there is one more task than the processors. The main advantage of this algorithm is its polynomial complexity, while, in general, the problem of the exact schedulability testing of real-time systems on multiprocessor platforms is NP-hard. The infeasibility test uses the same algorithm for an arbitrary task-to-processor ratio, providing a sufficient infeasibility condition: if the real-time system under test is not schedulable in some cases, the algorithm detects this. We conduct an experimental study of our algorithms on the datasets generated with different utilization values and compare them to several state-of-the-art schedulability tests. The experiments show that the performance of our algorithm exceeds the performance of its analogues while its accuracy is similar. | |
| 653 | |a Scheduling | ||
| 653 | |a Task scheduling | ||
| 653 | |a Microprocessors | ||
| 653 | |a Experiments | ||
| 653 | |a Polynomials | ||
| 653 | |a Algorithms | ||
| 653 | |a Computer aided scheduling | ||
| 653 | |a Real time | ||
| 653 | |a Multiprocessing | ||
| 653 | |a Deadlines | ||
| 653 | |a System theory | ||
| 653 | |a Priority scheduling | ||
| 700 | 1 | |a Anureev, Igor | |
| 700 | 1 | |a Kondratyev, Dmitry | |
| 773 | 0 | |t Applied System Innovation |g vol. 8, no. 1 (2025), p. 15 | |
| 786 | 0 | |d ProQuest |t Advanced Technologies & Aerospace Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3170915744/abstract/embedded/2AXJIZYYTBW5RQEH?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text + Graphics |u https://www.proquest.com/docview/3170915744/fulltextwithgraphics/embedded/2AXJIZYYTBW5RQEH?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3170915744/fulltextPDF/embedded/2AXJIZYYTBW5RQEH?source=fedsrch |