Performance Analysis of different Mathematical Algorithms in Parallel Environment
Author(s): Dilip Kumar Nayak, Mr. Avinash Dhole
Publication #: IJIRCT1601004
Date of Publication: 01.08.2016
Country: India
Pages: 20-25
Published In: Volume 2 Issue 1 August-2016
Abstract
In Present day, multicore systems have become popular as it provides parallelism and hence less delay, but multicore systems provide only hardware parallelism. In order to achieve best result we should use software parallelism also. To achieve software parallelism there are many programming model like OMP, MPI etc. Now a day’s high performance computing mainly center’s around parallel computing. Parallel computing is the ability to carry out multiple operations or tasks simultaneously. Ideally, parallel processing makes programs run faster because there are more engines (CPUs or cores) to run the program. Sequence and series like sin series ,cos series ,arithmetic progression, geometric progression ,harmonic progression are most frequently used in mathematical tools. Therefore the parallel computation is an efficient way to improve the performance. By putting some constraints on the data and taking the advantage of the hardware. The performance of the different sequential and serial algorithms can be significantly improved. This paper provides the review of various mathematical algorithms which has developed paralle.
Keywords: sequence and series, Geometric Progression(g.p.),Harmonic progression(h.p.) Arithmetic Progression (a.p.), Parallelism.
Download/View Count: 343
Share this Article