Abstract

In this paper, we address the problem of Worst Case Response Time (WCRT) analysis of hard real-time systems composed of sporadic tasks scheduled under non-preemptive Earliest Deadline First (EDF) scheduler. WCRT of each subtask is examined based on the constructed Directed Acyclic Graph of each task. Previous work, does not consider arbitrary timing requirements of subtasks; authors investigate simultaneous arrival time of subtasks only where arbitrary deadlines is not concerned. In contrast to previous work that provides guarantee for a task set that in fact is not schedulable in the worst case, our results show accurate WCRTs.KeywordsWorst Case Response TimeEDFNon-preemptive

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.