SEARCH_SERIAL
Search for Integer so that F(J) = C

SEARCH_SERIAL is a C++ program which searches integers between A and B for a value J such that F(J) = C.

For the particular example considered here, the solution will be F(1,674,924,981) = 45.

This program is intended as a starting point; both MPI and OpenMP can be used to make a parallel version.

Licensing:

The computer code and data files described and made available on this web page are distributed under the GNU LGPL license.

Languages:

SEARCH_SERIAL is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a PYTHON version.

Related Data and Programs:

FFT_SERIAL, a C++ program which demonstrates the computation of a Fast Fourier Transform, and is intended as a starting point for developing a parallel version using OpenMP.

FIRE_SERIAL, a C++ program which simulates a forest fire over a rectangular array of trees, starting at a single random location. It is intended as a starting point for the development of a parallel version.

HEATED_PLATE, a C++ program which solves the steady state heat equation in a 2D rectangular region, and is intended as a starting point for implementing an OpenMP parallel version.

MD, a C++ program which carries out a molecular dynamics simulation, and is intended as a starting point for implementing an OpenMP parallel version.

MXM_SERIAL, a C++ program which sets up a matrix multiplication problem A=B*C, intended as a starting point for implementing a parallel version.

POISSON_SERIAL, a C++ program which computes an approximate solution to the Poisson equation in a rectangle, and is intended as the starting point for the creation of a parallel version.

PRIME_SERIAL, a C++ program which counts the number of primes between 1 and N, intended as a starting point for the creation of a parallel version.

QUAD_SERIAL, a C++ program which approximates an integral using a quadrature rule, and is intended as a starting point for parallelization exercises.

SUBSET_SUM_SERIAL, a C++ program which seeks solutions of the subset sum problem, in which it is desired to find a subset of a set of integers which has a given sum; this version of the program is intended as a starting point for a parallel approach.

Reference:

1. Peter Arbenz, Wesley Petersen,
   Introduction to Parallel Computing - A practical guide with examples in C,
   Oxford University Press,
   ISBN: 0-19-851576-6,
   LC: QA76.58.P47.
2. Rohit Chandra, Leonardo Dagum, Dave Kohr, Dror Maydan, Jeff McDonald, Ramesh Menon,
   Parallel Programming in OpenMP,
   Morgan Kaufmann, 2001,
   ISBN: 1-55860-671-8,
   LC: QA76.642.P32.
3. Barbara Chapman, Gabriele Jost, Ruud vanderPas, David Kuck,
   Using OpenMP: Portable Shared Memory Parallel Processing,
   MIT Press, 2007,
   ISBN13: 978-0262533027,
   LC: QA76.642.C49.

Source Code:

• search_serial.cpp, the source code;

Examples and Tests:

• search_serial_output.txt, the output file;

List of Routines:

• MAIN is the main program for SEARCH_SERIAL.
• SEARCH searches integers in [A,B] for a J so that F(J) = C.
• F is the function we are analyzing.
• TIMESTAMP prints the current YMDHMS date as a time stamp.
• CPU_TIME returns a reading of the CPU clock.

You can go up one level to the C++ source codes.