Polynomial Exact Schedulability and Infeasibility Test for Fixed-Priority Scheduling on Multiprocessor Platforms › Research Explorer

DOI

https://doi.org/10.3390/asi8010015
Final published version

Natalia Garanina
Igor Anureev
Dmitry Kondratyev

Original language	English
Article number	15
Journal	Applied System Innovation
Volume	8
Issue number	1
DOIs	https://doi.org/10.3390/asi8010015
Publication status	Published - 20 Jan 2025

OECD FOS+WOS

1.02.ET COMPUTER SCIENCE, INFORMATION SYSTEMS
1.02.EP COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
2.02.AC AUTOMATION & CONTROL SYSTEMS
1.01.PN MATHEMATICS, APPLIED
2.11.IJ ENGINEERING, INDUSTRIAL

Research areas

Kripke model, exact schedulability test, fixed priority, non-preemptive tasks, real-time systems, sufficient infeasibility test

ID: 64918541