Abstract
The parallel processing facilities of Ada are based on the concept of rendezvous, which introduces a tight coupling between two cooperating tasks. Because of the asynnetry of the rendezvous, and of the typing system, these facilities cannot be used directly in a certain number of cases with particularly severe constraints on the system in terms of size, flexibility or extensibility. We indicate some typical such constraints, and investigate possible solutions in Ada. The performance of such solutions is analyzed, leading to an improved solution, which is then shown to be applicable to a large variety of situations.
Full Text
Published Version
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