|
cannam@95
|
1 <html lang="en">
|
|
cannam@95
|
2 <head>
|
|
cannam@95
|
3 <title>Multi-threaded FFTW - FFTW 3.3.3</title>
|
|
cannam@95
|
4 <meta http-equiv="Content-Type" content="text/html">
|
|
cannam@95
|
5 <meta name="description" content="FFTW 3.3.3">
|
|
cannam@95
|
6 <meta name="generator" content="makeinfo 4.13">
|
|
cannam@95
|
7 <link title="Top" rel="start" href="index.html#Top">
|
|
cannam@95
|
8 <link rel="prev" href="FFTW-Reference.html#FFTW-Reference" title="FFTW Reference">
|
|
cannam@95
|
9 <link rel="next" href="Distributed_002dmemory-FFTW-with-MPI.html#Distributed_002dmemory-FFTW-with-MPI" title="Distributed-memory FFTW with MPI">
|
|
cannam@95
|
10 <link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
|
|
cannam@95
|
11 <!--
|
|
cannam@95
|
12 This manual is for FFTW
|
|
cannam@95
|
13 (version 3.3.3, 25 November 2012).
|
|
cannam@95
|
14
|
|
cannam@95
|
15 Copyright (C) 2003 Matteo Frigo.
|
|
cannam@95
|
16
|
|
cannam@95
|
17 Copyright (C) 2003 Massachusetts Institute of Technology.
|
|
cannam@95
|
18
|
|
cannam@95
|
19 Permission is granted to make and distribute verbatim copies of
|
|
cannam@95
|
20 this manual provided the copyright notice and this permission
|
|
cannam@95
|
21 notice are preserved on all copies.
|
|
cannam@95
|
22
|
|
cannam@95
|
23 Permission is granted to copy and distribute modified versions of
|
|
cannam@95
|
24 this manual under the conditions for verbatim copying, provided
|
|
cannam@95
|
25 that the entire resulting derived work is distributed under the
|
|
cannam@95
|
26 terms of a permission notice identical to this one.
|
|
cannam@95
|
27
|
|
cannam@95
|
28 Permission is granted to copy and distribute translations of this
|
|
cannam@95
|
29 manual into another language, under the above conditions for
|
|
cannam@95
|
30 modified versions, except that this permission notice may be
|
|
cannam@95
|
31 stated in a translation approved by the Free Software Foundation.
|
|
cannam@95
|
32 -->
|
|
cannam@95
|
33 <meta http-equiv="Content-Style-Type" content="text/css">
|
|
cannam@95
|
34 <style type="text/css"><!--
|
|
cannam@95
|
35 pre.display { font-family:inherit }
|
|
cannam@95
|
36 pre.format { font-family:inherit }
|
|
cannam@95
|
37 pre.smalldisplay { font-family:inherit; font-size:smaller }
|
|
cannam@95
|
38 pre.smallformat { font-family:inherit; font-size:smaller }
|
|
cannam@95
|
39 pre.smallexample { font-size:smaller }
|
|
cannam@95
|
40 pre.smalllisp { font-size:smaller }
|
|
cannam@95
|
41 span.sc { font-variant:small-caps }
|
|
cannam@95
|
42 span.roman { font-family:serif; font-weight:normal; }
|
|
cannam@95
|
43 span.sansserif { font-family:sans-serif; font-weight:normal; }
|
|
cannam@95
|
44 --></style>
|
|
cannam@95
|
45 </head>
|
|
cannam@95
|
46 <body>
|
|
cannam@95
|
47 <div class="node">
|
|
cannam@95
|
48 <a name="Multi-threaded-FFTW"></a>
|
|
cannam@95
|
49 <a name="Multi_002dthreaded-FFTW"></a>
|
|
cannam@95
|
50 <p>
|
|
cannam@95
|
51 Next: <a rel="next" accesskey="n" href="Distributed_002dmemory-FFTW-with-MPI.html#Distributed_002dmemory-FFTW-with-MPI">Distributed-memory FFTW with MPI</a>,
|
|
cannam@95
|
52 Previous: <a rel="previous" accesskey="p" href="FFTW-Reference.html#FFTW-Reference">FFTW Reference</a>,
|
|
cannam@95
|
53 Up: <a rel="up" accesskey="u" href="index.html#Top">Top</a>
|
|
cannam@95
|
54 <hr>
|
|
cannam@95
|
55 </div>
|
|
cannam@95
|
56
|
|
cannam@95
|
57 <h2 class="chapter">5 Multi-threaded FFTW</h2>
|
|
cannam@95
|
58
|
|
cannam@95
|
59 <p><a name="index-parallel-transform-326"></a>In this chapter we document the parallel FFTW routines for
|
|
cannam@95
|
60 shared-memory parallel hardware. These routines, which support
|
|
cannam@95
|
61 parallel one- and multi-dimensional transforms of both real and
|
|
cannam@95
|
62 complex data, are the easiest way to take advantage of multiple
|
|
cannam@95
|
63 processors with FFTW. They work just like the corresponding
|
|
cannam@95
|
64 uniprocessor transform routines, except that you have an extra
|
|
cannam@95
|
65 initialization routine to call, and there is a routine to set the
|
|
cannam@95
|
66 number of threads to employ. Any program that uses the uniprocessor
|
|
cannam@95
|
67 FFTW can therefore be trivially modified to use the multi-threaded
|
|
cannam@95
|
68 FFTW.
|
|
cannam@95
|
69
|
|
cannam@95
|
70 <p>A shared-memory machine is one in which all CPUs can directly access
|
|
cannam@95
|
71 the same main memory, and such machines are now common due to the
|
|
cannam@95
|
72 ubiquity of multi-core CPUs. FFTW's multi-threading support allows
|
|
cannam@95
|
73 you to utilize these additional CPUs transparently from a single
|
|
cannam@95
|
74 program. However, this does not necessarily translate into
|
|
cannam@95
|
75 performance gains—when multiple threads/CPUs are employed, there is
|
|
cannam@95
|
76 an overhead required for synchronization that may outweigh the
|
|
cannam@95
|
77 computatational parallelism. Therefore, you can only benefit from
|
|
cannam@95
|
78 threads if your problem is sufficiently large.
|
|
cannam@95
|
79 <a name="index-shared_002dmemory-327"></a><a name="index-threads-328"></a>
|
|
cannam@95
|
80
|
|
cannam@95
|
81 <ul class="menu">
|
|
cannam@95
|
82 <li><a accesskey="1" href="Installation-and-Supported-Hardware_002fSoftware.html#Installation-and-Supported-Hardware_002fSoftware">Installation and Supported Hardware/Software</a>
|
|
cannam@95
|
83 <li><a accesskey="2" href="Usage-of-Multi_002dthreaded-FFTW.html#Usage-of-Multi_002dthreaded-FFTW">Usage of Multi-threaded FFTW</a>
|
|
cannam@95
|
84 <li><a accesskey="3" href="How-Many-Threads-to-Use_003f.html#How-Many-Threads-to-Use_003f">How Many Threads to Use?</a>
|
|
cannam@95
|
85 <li><a accesskey="4" href="Thread-safety.html#Thread-safety">Thread safety</a>
|
|
cannam@95
|
86 </ul>
|
|
cannam@95
|
87
|
|
cannam@95
|
88 <!-- -->
|
|
cannam@95
|
89 </body></html>
|
|
cannam@95
|
90
|
