Research Article
Performance Optimization by Integrating Memoization and MPI_Info Object for Sieve of Prime Numbers
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 177 - Issue 47 |
| Published: Mar 2020 |
| Authors: Haraprasad Naik, Mousumi Mishra, Gayatri Routray, Megharani Behera |
10.5120/ijca2020919983
|
Haraprasad Naik, Mousumi Mishra, Gayatri Routray, Megharani Behera . Performance Optimization by Integrating Memoization and MPI_Info Object for Sieve of Prime Numbers. International Journal of Computer Applications. 177, 47 (Mar 2020), 34-38. DOI=10.5120/ijca2020919983
@article{ 10.5120/ijca2020919983,
author = { Haraprasad Naik,Mousumi Mishra,Gayatri Routray,Megharani Behera },
title = { Performance Optimization by Integrating Memoization and MPI_Info Object for Sieve of Prime Numbers },
journal = { International Journal of Computer Applications },
year = { 2020 },
volume = { 177 },
number = { 47 },
pages = { 34-38 },
doi = { 10.5120/ijca2020919983 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2020
%A Haraprasad Naik
%A Mousumi Mishra
%A Gayatri Routray
%A Megharani Behera
%T Performance Optimization by Integrating Memoization and MPI_Info Object for Sieve of Prime Numbers%T
%J International Journal of Computer Applications
%V 177
%N 47
%P 34-38
%R 10.5120/ijca2020919983
%I Foundation of Computer Science (FCS), NY, USA
Abstract
Sieving prime numbers is an idle example of linear time algorithm since the first sieve of this kind proposed by Eratosthenes. Afterward many sieving algorithm are proposed such as-: Sieve of Sundaram, Sieve of Atkin, Sieve of Sorenson and wheel factorization of prime number. In this paper we have proposed the integration of parallelism with these sieving algorithm. We have proposed MPI_Info object with memoization to avoid redundant steps during prime number processing and adding them into the sieve. Nevertheless this paper also demonstrates the MPI Binding with familiar/popular object oriented programming language such as-: C++ and Java. This binding done through the two different tools which includes OpenMPI and MPJ Express.
References
- Aaron Weeden. (n.d.). Parallelization: Sieve of Eratothenes.
- Agosta,Francalanci. (2012). Automatic memoization for energy efficiency in financial applications. Sustainable Computing Informatics and Systems, 105–115.
- Alejandro Calendron, Felix Garcia, D. H., Jesus Carretero. (2013). Improving MPI application with a new MPI_Info and the uses of the memoization. EuroMPI.
- D. Bernstein, A. atkin. (2004). Prime Sieves Using Binary Quadratic Forms. Mathematics of Computation, 1023–1030.
- David J Wirian. (n.d.). Parallel Prime Sieve: Finding Prime Numbers.
- Graham,J.M. (2005). Open MPI:A flexible high performance MPI.
- J. Misra, D. G. (1978). A Linear Sieve Algorithm for Finding Prime Numbers. Communications of the ACM, 999–1003.
- Jeffrey M. Squyres. (1982). Design and Implementation of java bindings in Open MPI. Acta Informatica, 477–485.
- Jeffrey M.Squyres,Andrew Lumsdaine. (n.d.). Object Oriented MPI:A Class Liabrary for the Message Passing Interface.
- J.P Sorenson. (2006). The Pseudosquares Prime Sieve. Algorithmic Number Theory, 193–207.
- Mark Baker,Sang Lim. (n.d.). Mpi Java:An Object-Oriented Java interface to MPI.
- Michael A Bender, S. S. (2013). The I/O Complexity of Computing Prime Tables.
- Mirko Stoffers,Klaus Wehrle. (2006). Automated Memoization for Parameter Studies implemented in impure Languages.
- MPICH2 http://www.mpich.org/. (2013).
- N.Saxena,N.kayal, M. A. (2004). Primes is in P. Annals of Mathematics, 781–793.
- Open MPI.http://www.open-mpi .org/. (2013).
- P.Pritchard. (1982). Explaning the wheel sieve. Acta Informatica, 477–485.
- Umat A.Acar,Robert Harper. (2003). Selective Memoization.
Index Terms
Keywords