Mixing coroutines and processes in an Ada tasking implementation

Publisher Website
Google Scholar
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.

This publication has 2 references indexed in Scilit: