Abstract
Not all tasks in an Ada program make use of the full functionality defined in the language reference manual. Certain idiomatic uses of Ada tasks allow these tasks to be implemented as coroutines. This paper presents a method for mixing coroutines and processes to achieve a full implementation for Ada tasking. This approach allows a variety of trade-offs to be made between the level of concurrency, synchronization expense, and scheduling fairness. This, in turn, allows tuning the runtime support for specific application requirements and hardware capabilities.
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 callSimilar Papers
More From: ACM SIGAda Ada Letters
Disclaimer: 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.
