2018
DOI: 10.32604/csse.2018.33.031
|View full text |Cite
|
Sign up to set email alerts
|

A Scheduling Extension Scheme of the Earliest Deadline First Policy for Hard Real-Time Uniprocessor Systems Integrated on Posix Threads Based on Linux

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…The utilization of this system, with the assumption that all deadlines are equal to their periods, has a limitation. Equation ( 4) indicates this limitation [21].…”
Section: Edf Scheduling Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The utilization of this system, with the assumption that all deadlines are equal to their periods, has a limitation. Equation ( 4) indicates this limitation [21].…”
Section: Edf Scheduling Algorithmmentioning
confidence: 99%
“…In this case, EDF is an optimal scheduling policy among priority-based scheduling algorithms in which the deadlines are equal to their periods because the utilization value of no scheduling policy cannot reach above one [21].…”
Section: Edf Scheduling Algorithmmentioning
confidence: 99%