Ada 95 eliminates race conditions

Abstract

This brief paper raises the issue of whether Ada 95 gives full control of queuing when required. Ada 83 prevented the programmer from having detailed control and inadvertently introduced nasty race conditions. The only solution in Ada 83 was to abandon Ada tasking and use low level primitives such as semaphores. Ada 95 includes a number of new features such as the requeue statement, explicit priority control, queuing policy pragmas, access to task identities and facilities for synchronous and asynchronous task control. Do these fully resolve the issues?.<>