An Efficient Parallel Algorithm for Finite Exponential Function Using Modified Mesh of Trees

Exponential functions are so useful in real world situations. Three of the most common applications of exponential functions are population growth, exponential decay and compound interest. In this paper we present a parallel algorithm for finite exponential series. We map this parallel algorithm on n × n Modified Mesh of Trees[11], however the number of terms in exponential series should be equal to +1. This parallel algorithm requires 10log n + O(1) steps for computing finite exponential series of +1 terms.