forked from johannesgerer/jburkardt-f
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathprime_mpi.html
254 lines (213 loc) · 6.66 KB
/
prime_mpi.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
<html>
<head>
<title>
PRIME_MPI - Count Primes Using MPI
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
PRIME_MPI <br> Count Primes Using MPI
</h1>
<hr>
<p>
<b>PRIME_MPI</b>
is a FORTRAN90 program which
counts the number of primes between 1 and N,
using MPI to carry out the calculation in parallel.
</p>
<p>
The algorithm is completely naive. For each integer I, it simply checks
whether any smaller J evenly divides it. The total amount of work
for a given N is thus roughly proportional to 1/2*N^2.
</p>
<p>
This program is mainly a starting point for investigations into
parallelization.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>PRIME_MPI</b> is available in
<a href = "../../c_src/prime_mpi/prime_mpi.html">a C version</a> and
<a href = "../../cpp_src/prime_mpi/prime_mpi.html">a C++ version</a> and
<a href = "../../f77_src/prime_mpi/prime_mpi.html">a FORTRAN77 version</a> and
<a href = "../../f_src/prime_mpi/prime_mpi.html">a FORTRAN90 version</a> and
<a href = "../../py_src/prime_mpi/prime_mpi.html">a Python version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../f_src/communicator_mpi/communicator_mpi.html">
COMMUNICATOR_MPI</a>,
a FORTRAN90 program which
creates new communicators involving a subset of initial
set of MPI processes in the default communicator MPI_COMM_WORLD.
</p>
<p>
<a href = "../../f_src/heat_mpi/heat_mpi.html">
HEAT_MPI</a>,
a FORTRAN90 program which
solves the 1D Time Dependent Heat Equation using MPI.
</p>
<p>
<a href = "../../f_src/hello_mpi/hello_mpi.html">
HELLO_MPI</a>,
a FORTRAN90 program which
prints out "Hello, world!" using the MPI parallel programming environment.
</p>
<p>
<a href = "../../examples/moab/moab.html">
MOAB</a>,
examples which
illustrate the use of the MOAB job scheduler for a computer cluster.
</p>
<p>
<a href = "../../f_src/mpi/mpi.html">
MPI</a>,
FORTRAN90 programs which
illustrate the use of the MPI application program interface
for carrying out parallel computations in a distributed memory environment.
</p>
<p>
<a href = "../../f_src/mpi_stubs/mpi_stubs.html">
MPI_STUBS</a>,
a FORTRAN90 library which
contains "stub" MPI routines, allowing a user to compile, load, and possibly
run an MPI program on a serial machine.
</p>
<p>
<a href = "../../f_src/multitask_mpi/multitask_mpi.html">
MULTITASK_MPI</a>,
a FORTRAN90 program which
demonstrates how to "multitask", that is, to execute several unrelated
and distinct tasks simultaneously, using MPI for parallel execution.
</p>
<p>
<a href = "../../f_src/prime_openmp/prime_openmp.html">
PRIME_OPENMP</a>,
a FORTRAN90 program which
counts the number of primes between 1 and N, using OpenMP for parallel execution.
</p>
<p>
<a href = "../../m_src/prime_parfor/prime_parfor.html">
PRIME_PARFOR</a>,
a MATLAB program which
counts the number of primes between 1 and N; it runs in parallel
using MATLAB's "parfor" facility.
</p>
<p>
<a href = "../../f_src/prime_serial/prime_serial.html">
PRIME_SERIAL</a>,
a FORTRAN90 program which
counts the number of primes between 1 and N,
intended as a starting point for the creation of a parallel version.
</p>
<p>
<a href = "../../f_src/quad_mpi/quad_mpi.html">
QUAD_MPI</a>,
a FORTRAN90 program which
approximates an integral using a quadrature rule, and carries out the
computation in parallel using MPI.
</p>
<p>
<a href = "../../f_src/random_mpi/random_mpi.html">
RANDOM_MPI</a>,
a FORTRAN90 program which
demonstrates one way to generate the same sequence of random numbers
for both sequential execution and parallel execution under MPI.
</p>
<p>
<a href = "../../f_src/ring_mpi/ring_mpi.html">
RING_MPI</a>,
a FORTRAN90 program which
uses the MPI parallel programming environment, and measures the time
necessary to copy a set of data around a ring of processes.
</p>
<p>
<a href = "../../f_src/satisfy_mpi/satisfy_mpi.html">
SATISFY_MPI</a>,
a FORTRAN90 program which
demonstrates, for a particular circuit, an exhaustive search
for solutions of the circuit satisfiability problem, using MPI to
carry out the calculation in parallel.
</p>
<p>
<a href = "../../f_src/search_mpi/search_mpi.html">
SEARCH_MPI</a>,
a FORTRAN90 program which
searches integers between A and B for a value J such that F(J) = C,
using MPI for parallel execution.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Eratosthenes,<br>
A Method For Finding Prime Numbers,<br>
Papyrus 487.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "prime_mpi.f90">prime_mpi.f90</a>, the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<b>PRIME_FSU</b> compiles and runs the program on the FSU HPC cluster.
<ul>
<li>
<a href = "prime_fsu.sh">prime_fsu.sh</a>,
the MOAB script.
</li>
<li>
<a href = "prime_fsu_output.txt">prime_fsu_output.txt</a>,
the output file.
</li>
</ul>
</p>
<p>
<b>PRIME_SYSX</b> compiles and runs the program on Virginia Tech's System X cluster.
<ul>
<li>
<a href = "prime_sysx.sh">prime_sysx.sh</a>,
the script.
</li>
<li>
<a href = "prime_sysx_output.txt">prime_sysx_output.txt</a>,
the output file.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../f_src.html">
the FORTRAN90 source codes</a>.
</p>
<hr>
<i>
Last revised on 21 October 2011
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>