Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
SWIFTsim
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Deploy
Releases
Model registry
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
SWIFT
SWIFTsim
Commits
44683d78
Commit
44683d78
authored
9 years ago
by
Matthieu Schaller
Browse files
Options
Downloads
Patches
Plain Diff
Webpage, wiggles and new conclusion section title
parent
6f5b2239
Branches
Branches containing commit
Tags
Tags containing commit
2 merge requests
!136
Master
,
!80
PASC paper
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
theory/paper_pasc/pasc_paper.tex
+12
-9
12 additions, 9 deletions
theory/paper_pasc/pasc_paper.tex
with
12 additions
and
9 deletions
theory/paper_pasc/pasc_paper.tex
+
12
−
9
View file @
44683d78
...
...
@@ -166,13 +166,15 @@ OpenMP\cite{ref:Dagum1998} and MPI\cite{ref:Snir1998}, and domain
decompositions based on space-filling curves
\cite
{
warren1993parallel
}
.
The design and implementation of
\swift
\cite
{
gonnet2013swift,
%
theuns2015swift,gonnet2015efficient
}
, a large-scale cosmological
simulation code built from scratch, provided the perfect
opportunity to test some newer approaches, i.e.~task-based parallelism,
fully asynchronous communication, and graph partition-based
domain decompositions.
This paper describes the results obtained with these parallelisation
techniques.
theuns2015swift,gonnet2015efficient
}
, a large-scale cosmological simulation
code built from scratch, provided the perfect opportunity to test some newer
approaches, i.e.~task-based parallelism, fully asynchronous communication, and
graph partition-based domain decompositions. The code is open-source and
available at the address
\url
{
www.swiftsim.com
}
where all the test cases
presented in this paper can also be found.
This paper describes the results
obtained with these parallelisation techniques.
%#####################################################################################################
...
...
@@ -570,7 +572,8 @@ algorithm described above in the case of 32 MPI ranks.
Using 16 threads per node (no use of hyper-threading) with one MPI
rank per node, a reasonable parallel efficiency is achieved when
increasing the thread count from 1 (1 node) to 256 (16 nodes) even
on a relatively small test case.
on a relatively small test case. Wiggles are likely due to the way thread
affinity is set by the operating system at run time.
\label
{
fig:cosma
}}
\end{figure*}
...
...
@@ -669,7 +672,7 @@ test are shown on Fig.~\ref{fig:JUQUEEN2}.
%#####################################################################################################
\section
{
Conclusion
s
}
\section
{
Discussion
\&
Conclusion
}
When running on the SuperMUC machine with 32 nodes (512 cores), each MPI rank
contains approximately
$
1
.
6
\times
10
^
7
$
particles in
$
2
.
5
\times
10
^
5
$
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment