BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20230831T095746Z
LOCATION:Flüela
DTSTART;TZID=Europe/Stockholm:20230627T140000
DTEND;TZID=Europe/Stockholm:20230627T143000
UID:submissions.pasc-conference.org_PASC23_sess181_pap132@linklings.com
SUMMARY:Cornerstone: Octree Construction Algorithms for Scalable Particle 
 Simulations
DESCRIPTION:Paper\n\nSebastian Keller (ETH Zurich / CSCS), Aurélien Cavela
 n and Rubén Cabezon (University of Basel), Lucio Mayer (University of Zuri
 ch), and Florina Ciorba (University of Basel)\n\nThis paper presents an oc
 tree construction method, called Cornerstone, that facilitates global doma
 in decomposition and interactions between particles in mesh-free numerical
  simulations. Our method is based on algorithms developed for 3D computer 
 graphics, which we extend to distributed high performance computing (HPC) 
 systems. Cornerstone yields global and locally essential octrees and is ab
 le to operate on all levels of tree hierarchies in parallel. The resulting
  octrees are suitable for supporting the computation of various kinds of s
 hort and long range interactions in N-body methods, such as Barnes-Hut and
  the Fast Multipole Method (FMM). While we provide a CPU implementation, C
 ornerstone may run entirely on GPUs. This results in significantly faster 
 tree construction compared to execution on CPUs and serves as a powerful b
 uilding block for the design of simulation codes that move beyond an offlo
 ading approach, where only numerically intensive tasks are dispatched to G
 PUs. With data residing exclusively in GPU memory, Cornerstone eliminates 
 data movements between CPUs and GPUs. As an example, we employ Cornerstone
  to generate locally essential octrees for a Barnes-Hut treecode running o
 n almost the full LUMI-G system with up to 8 trillion particles.\n\nDomain
 : Physics, Computer Science, Machine Learning, and Applied Mathematics 
\n
 \nSession Chair: Theofilos Manitaras (ETH Zurich / CSCS)
END:VEVENT
END:VCALENDAR