Skip to main content

performance tuning - ParallelTable 70 times slower on 16 cores than Table on single core


Consider these code(sorry it's messy), why the ParallelTable version is 70 times slower than the Table version?


Quit[]
Clear["`*"]
$Version
(*
==> "8.0 for Linux x86 (64-bit) (February 23, 2011)"
*)
Kernels[]

(*
==> {}
*)
a = RandomReal[{0., 1.}, {401, 300000}];
b = RandomReal[{0., 1.}, {401, 300000}];
Developer`PackedArrayQ /@ {a, b}
(*
==> {True, True}
*)


ht = 2*0.375*^-9;
DFT[A_, ht_] :=
RotateRight[
ht/Sqrt[2 \[Pi]]*
Fourier[RotateLeft[A, Length[A]/2 - 1],
FourierParameters -> {1, 1}], Length[A]/2 - 1];

SmoothDFT[A_, ht_, n_] :=
DFT[Table[0., {(n - 1)*Length[A]/2}]~Join~A~Join~
Table[0., {(n - 1)*Length[A]/2}], ht];


SelectbyWRange[A_, {WMin_, WMax_}, {TakeWMin_, TakeWMax_}] :=
Module[{lthA, nMax, nMin}, lthA = Length[A];
nMin = Round[-((-WMax + lthA WMin)/(
WMax - WMin)) - ((1 - lthA) TakeWMin)/(WMax - WMin)];
nMax = Round[-((-WMax + lthA WMin)/(
WMax - WMin)) - ((1 - lthA) TakeWMax)/(WMax - WMin)];
Transpose[{Table[
TakeWMin + n *(TakeWMax - TakeWMin)/(nMax - nMin), {n, 0,
nMax - nMin}], Take[A, {nMin, nMax}]}]

]

Smtx1 =
Table[SelectbyWRange[-Im[
SmoothDFT[a[[n]], ht, 2]*
Conjugate[SmoothDFT[b[[n]], ht, 2]]], {-834., 834.}, {19.5,
20.5}], {n, 1, 2}]; // AbsoluteTiming

(*
==> {0.404922, Null}

*)
Kernels[]
(*
==> {}
*)
LaunchKernels[]
(*
==> {KernelObject[1, "local"], KernelObject[2, "local"],
KernelObject[3, "local"], KernelObject[4, "local"],
KernelObject[5, "local"], KernelObject[6, "local"],

KernelObject[7, "local"], KernelObject[8, "local"],
KernelObject[9, "local"], KernelObject[10, "local"],
KernelObject[11, "local"], KernelObject[12, "local"],
KernelObject[13, "local"], KernelObject[14, "local"],
KernelObject[15, "local"], KernelObject[16, "local"]}
*)
Smtx2 =
ParallelTable[
SelectbyWRange[-Im[
SmoothDFT[a[[n]], ht, 2]*

Conjugate[SmoothDFT[b[[n]], ht, 2]]], {-834., 834.}, {19.5,
20.5}], {n, 1, 2}]; // AbsoluteTiming

(*
==> {25.459674, Null}
*)

Note that I have 16 cores on the node and the table have only 2 elements, i.e. {n,1,2}, even if I change to {n,1,16}, the ParallelTable version is still 10 times slower than the Table version. If it is the overhead, why it has a such huge overhead? Thanks.


These are the screenshots:


enter image description here enter image description here



Update


1.As OleksandrR point out that there is no DistributeDefinitions, but in the documentation of ParallelTable it promises to automatically distribute the calculations (version 9):



ParallelTable is a parallel version of Table which automatically distributes different evaluations of expr among different kernels and processors.


The default value is DistributedContexts:>$DistributedContexts with $DistributedContexts:=$Context, which distributes definitions of all symbols in the current context, but does not distribute definitions of symbols from packages.



2.OleksandrR also gave an excellent analysis in this post, pointing out that the performance problem is the MemberQ function.


Indeed if we turn on the unpack warning, we can see it unpacks the array in call to MemberQ


On["Packing"];
Smtx2 = AbsoluteTiming[ParallelTable[

SelectbyWRange[-Im[SmoothDFT[a[[n]], ht, 2]*
Conjugate[SmoothDFT[b[[n]], ht, 2]]], {-834., 834.}, {19.5, 20.5}], {n, 1, 2}];]


Developer`FromPackedArray::unpack: Unpacking array in call to MemberQ. >>



(*{25.557433, Null}*)

However a second evaluation is much faster even the array still unpacks


ClearSystemCache[]

Smtx2 = AbsoluteTiming[ParallelTable[
SelectbyWRange[-Im[SmoothDFT[a[[n]], ht, 2]*
Conjugate[SmoothDFT[b[[n]], ht, 2]]], {-834., 834.}, {19.5, 20.5}], {n, 1, 2}];]


Developer`FromPackedArray::unpack: Unpacking array in call to MemberQ. >>



(*{0.156995, Null}*)

If we use the temporary fix of MemberQ proposed by Szabolcs in the same post, then the unpack warning is gone, but the evaluation is still slow.



Quit[]
On["Packing"];

(*need to reevaluate all the definition code above*)

memberQ[list_, form_] := Or @@ (MatchQ[#, form] & /@ list)
ClearAll[fix]
SetAttributes[fix, HoldAll]
fix[expr_] := Block[{MemberQ = memberQ}, expr]


Smtx2 = fix@
AbsoluteTiming[ParallelTable[SelectbyWRange[-Im[
SmoothDFT[a[[n]], ht, 2]*
Conjugate[SmoothDFT[b[[n]], ht, 2]]], {-834., 834.}, {19.5,
20.5}], {n, 1, 2}];]
(*{25.192359,Null}*)

So how to fix this?




Comments

Popular posts from this blog

plotting - How to draw lines between specified dots on ListPlot?

I would like to create a plot where I have unconnected dots and some connected. So far, I have figured out how to draw the dots. My code is the following: ListPlot[{{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4,13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full] I have thought using ListLinePlot command, but I don't know how to specify to the command to draw only selected lines between the dots. Do have any suggestions/hints on how to do that? Thank you. Answer One possibility would be to use Epilog with Line : ListPlot[ {{1, 1}, {2, 2}, {3, 3}, {4, 4}, {1, 4}, {2, 5}, {3, 6}, {4, 7}, {1, 7}, {2, 8}, {3, 9}, {4, 10}, {1, 10}, {2, 11}, {3, 12}, {4, 13}, {2.5, 7}}, Ticks -> {{1, 2, 3, 4}, None}, AxesStyle -> Thin, TicksStyle -> Directive[Black, Bold, 12], Mesh -> Full, Epilog -> { Line[ ...

equation solving - Invert and fit implicitly defined curve

I need to fit an implicitly defined curve. I thought I could get some data out of Solve , and then using FindFit . Therefore, I would like to find the relation the parametric curve defined by $F(x,y)=0$: Solve[-(1/2) + 1/2 (0.41202 BesselK[0, 0.1 Sqrt[x^2 + y^2]] + (0.101483 x BesselK[1, 0.1 Sqrt[x^2 + y^2]])/Sqrt[x^2 + y^2]) == 0, y] But I can't get an output: Solve was unable to solve the system with inexact coefficients or the system obtained by direct rationalization of inexact numbers present in the system. Since many of the methods used by Solve require exact input, providing Solve with an exact version of the system may help. >> Edit: In particular, I would like to fit the data coming from the curve with the expression of another curve, and not with a function $f(x)$. In particular, since this clearly looks like a cardioid , I would like it to fit to something like it. What other strategies could I try?

dynamic - How can I make a clickable ArrayPlot that returns input?

I would like to create a dynamic ArrayPlot so that the rectangles, when clicked, provide the input. Can I use ArrayPlot for this? Or is there something else I should have to use? Answer ArrayPlot is much more than just a simple array like Grid : it represents a ranged 2D dataset, and its visualization can be finetuned by options like DataReversed and DataRange . These features make it quite complicated to reproduce the same layout and order with Grid . Here I offer AnnotatedArrayPlot which comes in handy when your dataset is more than just a flat 2D array. The dynamic interface allows highlighting individual cells and possibly interacting with them. AnnotatedArrayPlot works the same way as ArrayPlot and accepts the same options plus Enabled , HighlightCoordinates , HighlightStyle and HighlightElementFunction . data = {{Missing["HasSomeMoreData"], GrayLevel[ 1], {RGBColor[0, 1, 1], RGBColor[0, 0, 1], GrayLevel[1]}, RGBColor[0, 1, 0]}, {GrayLevel[0], GrayLevel...