An Efficient Parallel Approach for Mapping Finite Binomial Series (Special Cases) on Bi Swapped Network Mesh

The efficient parallel mapping of numerical problems (over different parallel architectures) is necessary for fast execution of massive data. In fact, it is a challenging task and significant ongoing subject of research. The Bi Swapped Network (BSN) is recently reported 2-level hybrid and symmetrical optoelectronic network architecture, offer major improvements especially for drawbacks aroused due to the asymmetrical behavior of the well known swapped/OTIS network. In this paper, the efficient parallel mapping of binomial function (special cases: Taylor series and Negative Binomial Series) of 2n4 + 1 terms is presented on n × n Bi Swapped Network mesh in 2T + 24(n − 1) electronic and 8 optical moves, Here, we assume T is the time required to compute parallel prefix for each identical cluster (mesh).