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:20241120T082408Z
LOCATION:HG F 26.3
DTSTART;TZID=Europe/Stockholm:20240603T123000
DTEND;TZID=Europe/Stockholm:20240603T130000
UID:submissions.pasc-conference.org_PASC24_sess161_msa182@linklings.com
SUMMARY:IPPL: A Massively Parallel, Performance Portable C++ Library for P
 article-Mesh Methods and Efficient Solvers
DESCRIPTION:Minisymposium\n\nSonali Mayani (Paul Scherrer Institute, ETH Z
 urich); Antoine Cerfon (Type One Energy, New York University); Matthias Fr
 ey (University of St Andrews); Veronica Montanaro (ETH Zurich); Sriramkris
 hnan Muralikrishnan (Forschungszentrum Jülich); Alessandro Vinciguerra (ET
 H Zurich); and Andreas Adelmann (Paul Scherrer Institute)\n\nWe present th
 e Independent Parallel Particle Layer (IPPL), a performance portable C++ l
 ibrary for particle-in-cell methods. IPPL makes use of Kokkos (a performan
 ce portability abstraction layer), HeFFTe (a library for large scale FFTs)
 , and MPI (Message Passing Interface) to deliver a portable, massively par
 allel toolkit for particle-mesh methods. One of the advantages of such a f
 ramework is the ability to be a test-bed for new algorithms which seek to 
 improve runtime and efficiency of large scale simulations, for example in 
 the beam and plasma physics communities. Concretely, we have implemented a
 n efficient and portable free-space solver for the Poisson equation based 
 on the algorithm suggested by Vico et al. (2016). This fast solver has spe
 ctral convergence, as opposed to the second-order convergence of the state
 -of-the-art Hockney-Eastwood method. The ability to use coarser grids to a
 chieve similar resolutions with the new solver allows for higher resolutio
 n simulations with a lower memory footprint, which is especially important
  for GPU usage. Finally, we show scaling studies on the Perlmutter machine
  at NERSC, on both CPUs and GPUs, with efficiencies staying above 50% in t
 he strong scaling case.\n\nDomain: Engineering, Physics, Computational Met
 hods and Applied Mathematics\n\nSession Chair: Andreas Adelmann (Paul Sche
 rrer Institute, ETH Zurich)
END:VEVENT
END:VCALENDAR
