Abstract
This paper focuses on reducing the computational cost of iterative algorithms used to evaluate the schedulability of Real-Time Systems. These algorithms calculate the worst case response time of each task. Through simulations it is found that the proposed new algorithm produces a significant reduction in the average temporal cost, reaching in some cases a reduction of O(n2) to O(n.log(n)), with respect to classical response time evaluation algorithms.
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.
