forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsatisfy_mpi.html
282 lines (238 loc) · 7.54 KB
/
satisfy_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
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
<html>
<head>
<title>
SATISFY_MPI - Circuit Satisfiability Using MPI
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
SATISFY_MPI <br> Circuit Satisfiability Using MPI
</h1>
<hr>
<p>
<b>SATISFY_MPI</b>
is a C++ program which
demonstrates, for a particular circuit, an exhaustive search
for solutions of the circuit satisfy problem. This version of
the program uses MPI to carry out the solution in parallel.
</p>
<p>
This problem assumes that we are given a logical circuit of AND, OR and NOT
gates, with N binary inputs and a single output. We are to determine all
inputs which produce a 1 as the output.
</p>
<p>
The general problem is NP complete, so there is no known polynomial-time
algorithm to solve the general case. The natural way to search for solutions
then is exhaustive search.
</p>
<p>
In an interesting way, this is a very extreme and discrete version of
the problem of maximizing a scalar function of multiple variables.
The difference is that here we know that both the input and output
only have the values 0 and 1, rather than a continuous range of real
values!
</p>
<p>
This problem was a natural candidate for parallel computation, since
the individual evaluations of the circuit are completely independent.
</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>SATISFY_MPI</b> is available in
<a href = "../../c_src/satisfy_mpi/satisfy_mpi.html">a C version</a> and
<a href = "../../cpp_src/satisfy_mpi/satisfy_mpi.html">a C++ version</a> and
<a href = "../../f77_src/satisfy_mpi/satisfy_mpi.html">a FORTRAN77 version</a> and
<a href = "../../f_src/satisfy_mpi/satisfy_mpi.html">a FORTRAN90 version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../data/cnf/cnf.html">
CNF</a>,
a data directory which
describes the DIMACS CNF file format for defining instances of the
satisfy problem in for boolean formulas in conjunctive normal form.
</p>
<p>
<a href = "../../cpp_src/communicator_mpi/communicator_mpi.html">
COMMUNICATOR_MPI</a>,
a C++ 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 = "../../cpp_src/heat_mpi/heat_mpi.html">
HEAT_MPI</a>,
a C++ program which
solves the 1D Time Dependent Heat Equation using MPI.
</p>
<p>
<a href = "../../cpp_src/hello_mpi/hello_mpi.html">
HELLO_MPI</a>,
a C++ program which
prints out "Hello, world!" using the MPI parallel programming environment.
</p>
<p>
<a href = "../../f_src/lau_np/lau_np.html">
LAU_NP</a>,
a FORTRAN90 library which
implements heuristic algorithms for various NP-hard combinatorial problems.
</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 = "../../cpp_src/mpi/mpi.html">
MPI</a>,
C++ programs which
illustrate the use of the MPI application program interface
for carrying out parallel computatioins in a distributed memory environment.
</p>
<p>
<a href = "../../cpp_src/multitask_mpi/multitask_mpi.html">
MULTITASK_MPI</a>,
a C++ 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 = "../../cpp_src/quad_mpi/quad_mpi.html">
QUAD_MPI</a>,
a C++ program which
approximates an integral using a quadrature rule, and carries out the
computation in parallel using MPI.
</p>
<p>
<a href = "../../cpp_src/random_mpi/random_mpi.html">
RANDOM_MPI</a>,
a C++ 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 = "../../cpp_src/ring_mpi/ring_mpi.html">
RING_MPI</a>,
a C++ 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 = "../../cpp_src/satisfy/satisfy.html">
SATISFY</a>,
a C++ program which
solves the circuit satisfy problem.
</p>
<p>
<a href = "../../cpp_src/satisfy_openmp/satisfy_openmp.html">
SATISFY_OPENMP</a>,
a C++ program which
solves the circuit satisfy problem using the OpenMP parallel programming system.
</p>
<p>
<a href = "../../cpp_src/search_mpi/search_mpi.html">
SEARCH_MPI</a>,
a C++ program which
searches integers between A and B for a value J such that F(J) = C,
using MPI for parallel execution.
</p>
<p>
<a href = "../../cpp_src/wave_mpi/wave_mpi.html">
WAVE_MPI</a>,
a C++ program which
uses finite differences and MPI to estimate a solution to the
wave equation.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Michael Quinn,<br>
Parallel Programming in C with MPI and OpenMP,<br>
McGraw-Hill, 2004,<br>
ISBN13: 978-0071232654,<br>
LC: QA76.73.C15.Q55.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "satisfy_mpi.cpp">satisfy_mpi.cpp</a>, the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<b>SATISFY_LOCAL</b> compiles and runs the program on the local machine,
which presumably has a version of MPI installed.
<ul>
<li>
<a href = "satisfy_local.sh">satisfy_local.sh</a>,
the BASH script.
</li>
<li>
<a href = "satisfy_local_output.txt">satisfy_local_output.txt</a>,
the output file.
</li>
</ul>
</p>
<p>
<b>SATISFY_FSU</b> compiles and runs the program on the FSU HPC cluster.
<ul>
<li>
<a href = "satisfy_fsu.sh">satisfy_fsu.sh</a>,
the MOAB script.
</li>
<li>
<a href = "satisfy_fsu_output.txt">satisfy_fsu_output.txt</a>,
the output file.
</li>
</ul>
</p>
<p>
<b>SATISFY_SYSX</b> compiles and runs the program on Virginia Tech's System X cluster.
<ul>
<li>
<a href = "satisfy_sysx.sh">satisfy_sysx.sh</a>,
the MOAB script.
</li>
<li>
<a href = "satisfy_sysx_output.txt">satisfy_sysx_output.txt</a>,
the output file.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last revised on 14 October 2013.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>