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:Davos
DTSTART;TZID=Europe/Stockholm:20230627T102800
DTEND;TZID=Europe/Stockholm:20230627T103000
UID:submissions.pasc-conference.org_PASC23_sess110_pos145@linklings.com
SUMMARY:P56 - The P4est Software for Parallel AMR: A Shared Memory Workflo
 w
DESCRIPTION:Poster\n\nMikhail Kirilin and Carsten Burstedde (University of
  Bonn)\n\nParallel adaptive mesh refinement (AMR) is a key technique when 
 simulations are required to capture time-dependent and/or multiscale featu
 res. A forest of octrees is a data structure to represent the recursive ad
 aptive refinement of an initial, conforming coarse mesh of hexahedra. This
  poster presents several recent enhancements to the p4est software for for
 est-of-octrees AMR. The first introduces new ways of encoding quadrants as
  atomic objects, which vary both the in-memory binary format and the assoc
 iated algorithms. We present a 128-bit AVX version and an optimized long i
 nteger format, respectively. The second enhancement exploits MPI-3 shared 
 memory windows to eliminate redundancy of quadrant and metadata storage wi
 thin each shared memory node. In conclusion, we demonstrate how different 
 approaches to shared memory use affect performance, along with the compari
 son of runtimes for various quadrant implementations and representative si
 mulation pipelines.\n\nSession Chair: Jibonananda Sanyal (National Renewab
 le Energy Laboratory)
END:VEVENT
END:VCALENDAR