attic/hpc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Merge branch 'master' of bitbucket.org:winfried/hpc

Browse source
This commit is contained in:
Armin Friedl 2016-06-24 22:48:23 +02:00
commit 0cecff4079
2 changed files with 9 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

BIN
reduce/report/report.pdf
View file

Binary file not shown.

9
reduce/report/report.tex
View file

@ -375,6 +375,15 @@ The number of repetitions is the same as for the last test at 30.
\section{Analysis} \section{Analysis}
\label{sec:analysis} \label{sec:analysis}
Our first result seen in \prettyref{fig:nodeplot} suggests that our implementation using the binomial tree got the best results by a big margin.
This result was very surprising to us because we expected that the MPI\_Reduce function of the library would outperform our rather simple implementations.
However this seems not to be the case and such tree algorithms are apparently really good for the dataset tested there.
Although the result of the MPI\_Reduce function seems to very unstable and it varies a lot during the test.
This might be due to a too low number of repetitions, the very short execution time or some other factors.
That the binary tree performed better than the Fibonacci tree was also quite surprising, since the communication pattern of the Fibonacci tree is almost round optimal in contrast to the binary tree.
\newpage
\section{Appendix} \section{Appendix}
\label{sec:appendix} \label{sec:appendix}