Efficient Exact Response Time Analysis for Fixed Priority Scheduling in Lowest Priority First-Based Feasibility Tests

The exact response time analysis for fixed priority scheduling (FPS) in the lowest priority first-based feasibility tests is commonly required as a part of system design tools. This letter proposes an efficient method for this, which we named incremental lower bound (ILB) calculation method. Compare...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE embedded systems letters Jg. 13; H. 3; S. 69 - 72
1. Verfasser: Kim, Saehwa
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 01.09.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Dynamic scheduling
Feasibility
Job shop scheduling
Lower bounds
Mathematical analysis
Mathematical model
Multiprocessing/multiprogramming/multitasking
Priority scheduling
real-time and embedded systems
Response time
Run time (computers)
scheduling
Systems design
Task analysis
Time factors
worst-case response time (WCRT) analysis
ISSN:1943-0663, 1943-0671
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The exact response time analysis for fixed priority scheduling (FPS) in the lowest priority first-based feasibility tests is commonly required as a part of system design tools. This letter proposes an efficient method for this, which we named incremental lower bound (ILB) calculation method. Compared to the best algorithm that has been known so far, which is the incremental calculation method, ILB reduces the feasibility test iterations/run times by more than 38% and 20% regardless of varying utilization and the number of tasks in task sets.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1943-0663
1943-0671
DOI:10.1109/LES.2020.3025600