EXAMPLE OF ADA TASKING.

Three ways are discussed that use Ada programming language to calculate mathematical expressions when the term can be treated independently. For each of these methods (sequential, rendezvous and recursion) a program is written. If there is more than one processor, then the sequential method is not taking full advantage of the computer. Both rendezvous and recursion have an internal bookkeeping overhead. Depending on the problem, one method may be faster than another. Complete examples of each method are given with some modifications. The dimensionality of the array is used as a variable. The reason for this is to capture the effect of exceeding the number of processors in a multi-processor system. In this respect, the programs are designed for a system with four or less processors.