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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
