Abstract
In distributed hard real-time systems, tasks not only have timing constraints but also often have precedence constraints caused by communication among them. In this paper a new schedulability analysis algorithm for distributed hard real-time systems is proposed in which both precedence constraints and communication costs are considered and represented by offsets and modified deadlines. To obtain a tight upper bound for the worst case response time, the concepts of local critical instant and local worst case response time are introduced. They are used to calculate global worst case response time in the system. The proposed schedulability analysis is compared with other schedulability analyses using test cases. The comparison shows that the proposed analysis is more accurate than the compared analyses.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
