Abstract
The inclusion of dynamic ceiling priorities in Ada is a topic of discussion in the Real-Time Ada community. Several approaches have been discussed in previous editions of the International Real-Time Ada Workshop, which have allowed to identify the problems associated with this issue, mainly the interaction of such feature with tasking, consistency and efficiency of implementation. In this paper, a new approach for dynamic ceilings is presented. It is based on implementing the ceiling change as a predefined protected operation itself, which allows to eliminate the potential for data corruption that other approaches introduce, without the need for additional locks.The paper also discusses the use of the proposed operation in the context of mode changes.
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.
