Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
SWIFTweb
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD 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
SWIFTweb
Commits
47af426e
Commit
47af426e
authored
7 years ago
by
Matthieu Schaller
Browse files
Options
Downloads
Patches
Plain Diff
Added the missing slides of the PASC-2016 conference.
parent
18aabe0f
No related branches found
No related tags found
1 merge request
!4
Added the missing slides of the PASC-2016 conference.
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
data/talks.yaml
+3
-1
3 additions, 1 deletion
data/talks.yaml
with
3 additions
and
1 deletion
data/talks.yaml
+
3
−
1
View file @
47af426e
...
...
@@ -73,7 +73,9 @@ cards:
author
:
Matthieu Schaller
abstract
:
"
We
present
a
new
open-source
cosmological
code,
called
SWIFT,
designed
to
solve
the
equations
of
hydrodynamics
using
a
particle-based
approach
(Smooth
Particle
Hydrodynamics)
on
hybrid
shared/distributed-memory
architectures.
SWIFT
was
designed
from
the
bottom
up
to
provide
excellent
strong
scaling
on
both
commodity
clusters
(Tier-2
systems)
and
Top100-supercomputers
(Tier-0
systems),
without
relying
on
architecture-specific
features
or
specialized
accelerator
hardware.
This
performance
is
due
to
three
main
computational
approaches:
(1)
Task-based
parallelism
for
shared-memory
parallelism,
which
provides
fine-grained
load
balancing
and
thus
strong
scaling
on
large
numbers
of
cores.
(2)
Graph-based
domain
decomposition,
which
uses
the
task
graph
to
decompose
the
simulation
domain
such
that
the
work,
as
opposed
to
just
the
data,
as
is
the
case
with
most
partitioning
schemes,
is
equally
distributed
across
all
nodes.
(3)
Fully
dynamic
and
asynchronous
communication,
in
which
communication
is
modelled
as
just
another
task
in
the
task-based
scheme,
sending
data
whenever
it
is
ready
and
deferring
on
tasks
that
rely
on
data
from
other
nodes
until
it
arrives.
In
order
to
use
these
approaches,
the
code
had
to
be
re-written
from
scratch,
and
the
algorithms
therein
adapted
to
the
task-based
paradigm.
As
a
result,
we
can
show
upwards
of
60%
parallel
efficiency
for
moderate-sized
problems
when
increasing
the
number
of
cores
512-fold,
on
both
x86-based
and
Power8-based
architectures."
links
:
# THESE SLIDES ARE MISSING.
-
href
:
"
PASC_2016.pdf"
name
:
Slides
-
href
:
"
https://arxiv.org/abs/1606.02738"
name
:
Paper
...
...
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