Abstract
This paper analyzes the efficiency problems related to the implementation of the ADA tasking facilities on monoprocessor and multiprocessor systems. Three different implementations of the basic communication mechanism in ADA - the rendezvous concept - are discussed and compared. The implementation approach is the same in the three cases and it consists of translating the ADA parallel constructs into procedural calls to kernel primitives. The kernel primitives corresponding to the most complex implementation are described.
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
