Added SPHERIC 2018 talk and paper

data/pubs.yaml

@@ -3,7 +3,7 @@ cards:
     date: "15 Sep 2013"
     img: "matth.png"
     link: "https://arxiv.org/abs/1309.3783"
-    journal: "Proceedinds of the 8th SPHERIC workshop"
+    journal: "Proceedinds of the 8th SPHERIC International Workshop"
         
   - title: "Efficient and Scalable Algorithms for Smoothed Particle Hydrodynamics on Hybrid Shared/Distributed-Memory Architectures"
     date: "8 Apr 2014"
@@ -34,3 +34,9 @@ cards:
     img: "james_paper.png"
     link: "https://arxiv.org/abs/1804.06231"
     journal: "Advances in Parallel Computing, Volume 32"
+
+  - title: "SWIFT: Maintaining weak-scalability with a dynamic range of 10^4 in time-step size to harness extreme adaptivity"
+    date: " Jul 2018"
+    img: "spheric_2018.png"
+    link: "https://arxiv.org/abs/1807.01341"
+    journal: "Proceedings of the 13th SPHERIC International Workshop"

data/talks.yaml

@@ -4,6 +4,37 @@
 # references. Nominally we will use /talks.
 
 cards:
+  - meeting: 13th SPHERIC International Workshop
+    location: Galway, Ireland
+    date: 26 June 2018
+    title: "SWIFT: Maintaining weak-scalability with a dynamic range of 10^4 in time-step size to harness extreme adaptivity"
+    author: Josh Borrow, Matthieu Schaller
+    abstract: "Cosmological simulations require the use of a multiple
+    time-stepping scheme. Without such a scheme, cosmological
+    simulations would be impossible due to their high level of dynamic
+    range; over eleven orders of magnitude in density. Such a large
+    dynamic range leads to a range of over four orders of magnitude in
+    time-step, which presents a significant load-balancing
+    challenge. In this work, the extreme adaptivity that cosmological
+    simulations present is tackled in three main ways through the use
+    of the code SWIFT. First, an adaptive mesh is used to ensure that
+    only the relevant particles are interacted in a given
+    time-step. Second, task-based parallelism is used to ensure
+    efficient load-balancing within a single node, using pthreads and
+    SIMD vectorisation. Finally, a domain decomposition strategy is
+    presented, using the graph domain decomposition library METIS,
+    that bisects the work that must be performed by the simulation
+    between nodes using MPI. These three strategies are shown to give
+    SWIFT near-perfect weak-scaling characteristics, only losing 25%
+    performance when scaling from 1 to 4096 cores on a representative
+    problem, whilst being more than 30x faster than the de-facto
+    standard Gadget-2 code."
+    links:
+      - href: "SPHERIC_2018.pdf"
+        name: Slides
+      - href: "https://arxiv.org/abs/1807.01341"
+        name: Paper
+
   - meeting: European Week of Astronomy and Space Science 2018
     location: Liverpool, UK
     date: April 2018