Abstract
The Ada language has been faulted for not providing an efficient and reliable mechanism to support periodic execution of tasks. Formulations that rely on delay statements in each periodic task or on user-supplied dispatcher tasks are unreliable or inefficient. This paper presents a simple model based on periodic pseudo-interrupts. This model can be efficiently implemented within the confines of the 1983 Ada language standard.
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.
