Mercurial > hg > sv-dependency-builds
comparison src/fftw-3.3.8/doc/html/Load-balancing.html @ 82:d0c2a83c1364
Add FFTW 3.3.8 source, and a Linux build
author | Chris Cannam |
---|---|
date | Tue, 19 Nov 2019 14:52:55 +0000 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
81:7029a4916348 | 82:d0c2a83c1364 |
---|---|
1 <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> | |
2 <html> | |
3 <!-- This manual is for FFTW | |
4 (version 3.3.8, 24 May 2018). | |
5 | |
6 Copyright (C) 2003 Matteo Frigo. | |
7 | |
8 Copyright (C) 2003 Massachusetts Institute of Technology. | |
9 | |
10 Permission is granted to make and distribute verbatim copies of this | |
11 manual provided the copyright notice and this permission notice are | |
12 preserved on all copies. | |
13 | |
14 Permission is granted to copy and distribute modified versions of this | |
15 manual under the conditions for verbatim copying, provided that the | |
16 entire resulting derived work is distributed under the terms of a | |
17 permission notice identical to this one. | |
18 | |
19 Permission is granted to copy and distribute translations of this manual | |
20 into another language, under the above conditions for modified versions, | |
21 except that this permission notice may be stated in a translation | |
22 approved by the Free Software Foundation. --> | |
23 <!-- Created by GNU Texinfo 6.3, http://www.gnu.org/software/texinfo/ --> | |
24 <head> | |
25 <title>FFTW 3.3.8: Load balancing</title> | |
26 | |
27 <meta name="description" content="FFTW 3.3.8: Load balancing"> | |
28 <meta name="keywords" content="FFTW 3.3.8: Load balancing"> | |
29 <meta name="resource-type" content="document"> | |
30 <meta name="distribution" content="global"> | |
31 <meta name="Generator" content="makeinfo"> | |
32 <meta http-equiv="Content-Type" content="text/html; charset=utf-8"> | |
33 <link href="index.html#Top" rel="start" title="Top"> | |
34 <link href="Concept-Index.html#Concept-Index" rel="index" title="Concept Index"> | |
35 <link href="index.html#SEC_Contents" rel="contents" title="Table of Contents"> | |
36 <link href="MPI-Data-Distribution.html#MPI-Data-Distribution" rel="up" title="MPI Data Distribution"> | |
37 <link href="Transposed-distributions.html#Transposed-distributions" rel="next" title="Transposed distributions"> | |
38 <link href="Basic-and-advanced-distribution-interfaces.html#Basic-and-advanced-distribution-interfaces" rel="prev" title="Basic and advanced distribution interfaces"> | |
39 <style type="text/css"> | |
40 <!-- | |
41 a.summary-letter {text-decoration: none} | |
42 blockquote.indentedblock {margin-right: 0em} | |
43 blockquote.smallindentedblock {margin-right: 0em; font-size: smaller} | |
44 blockquote.smallquotation {font-size: smaller} | |
45 div.display {margin-left: 3.2em} | |
46 div.example {margin-left: 3.2em} | |
47 div.lisp {margin-left: 3.2em} | |
48 div.smalldisplay {margin-left: 3.2em} | |
49 div.smallexample {margin-left: 3.2em} | |
50 div.smalllisp {margin-left: 3.2em} | |
51 kbd {font-style: oblique} | |
52 pre.display {font-family: inherit} | |
53 pre.format {font-family: inherit} | |
54 pre.menu-comment {font-family: serif} | |
55 pre.menu-preformatted {font-family: serif} | |
56 pre.smalldisplay {font-family: inherit; font-size: smaller} | |
57 pre.smallexample {font-size: smaller} | |
58 pre.smallformat {font-family: inherit; font-size: smaller} | |
59 pre.smalllisp {font-size: smaller} | |
60 span.nolinebreak {white-space: nowrap} | |
61 span.roman {font-family: initial; font-weight: normal} | |
62 span.sansserif {font-family: sans-serif; font-weight: normal} | |
63 ul.no-bullet {list-style: none} | |
64 --> | |
65 </style> | |
66 | |
67 | |
68 </head> | |
69 | |
70 <body lang="en"> | |
71 <a name="Load-balancing"></a> | |
72 <div class="header"> | |
73 <p> | |
74 Next: <a href="Transposed-distributions.html#Transposed-distributions" accesskey="n" rel="next">Transposed distributions</a>, Previous: <a href="Basic-and-advanced-distribution-interfaces.html#Basic-and-advanced-distribution-interfaces" accesskey="p" rel="prev">Basic and advanced distribution interfaces</a>, Up: <a href="MPI-Data-Distribution.html#MPI-Data-Distribution" accesskey="u" rel="up">MPI Data Distribution</a> [<a href="index.html#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="Concept-Index.html#Concept-Index" title="Index" rel="index">Index</a>]</p> | |
75 </div> | |
76 <hr> | |
77 <a name="Load-balancing-1"></a> | |
78 <h4 class="subsection">6.4.2 Load balancing</h4> | |
79 <a name="index-load-balancing"></a> | |
80 | |
81 <p>Ideally, when you parallelize a transform over some <em>P</em> | |
82 processes, each process should end up with work that takes equal time. | |
83 Otherwise, all of the processes end up waiting on whichever process is | |
84 slowest. This goal is known as “load balancing.” In this section, | |
85 we describe the circumstances under which FFTW is able to load-balance | |
86 well, and in particular how you should choose your transform size in | |
87 order to load balance. | |
88 </p> | |
89 <p>Load balancing is especially difficult when you are parallelizing over | |
90 heterogeneous machines; for example, if one of your processors is a | |
91 old 486 and another is a Pentium IV, obviously you should give the | |
92 Pentium more work to do than the 486 since the latter is much slower. | |
93 FFTW does not deal with this problem, however—it assumes that your | |
94 processes run on hardware of comparable speed, and that the goal is | |
95 therefore to divide the problem as equally as possible. | |
96 </p> | |
97 <p>For a multi-dimensional complex DFT, FFTW can divide the problem | |
98 equally among the processes if: (i) the <em>first</em> dimension | |
99 <code>n0</code> is divisible by <em>P</em>; and (ii), the <em>product</em> of | |
100 the subsequent dimensions is divisible by <em>P</em>. (For the advanced | |
101 interface, where you can specify multiple simultaneous transforms via | |
102 some “vector” length <code>howmany</code>, a factor of <code>howmany</code> is | |
103 included in the product of the subsequent dimensions.) | |
104 </p> | |
105 <p>For a one-dimensional complex DFT, the length <code>N</code> of the data | |
106 should be divisible by <em>P</em> <em>squared</em> to be able to divide | |
107 the problem equally among the processes. | |
108 </p> | |
109 | |
110 | |
111 | |
112 </body> | |
113 </html> |