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:20190719T085745Z
LOCATION:HG F 3
DTSTART;TZID=Europe/Stockholm:20190614T120000
DTEND;TZID=Europe/Stockholm:20190614T123000
UID:submissions.pasc-conference.org_PASC19_sess123_msa151@linklings.com
SUMMARY:Design of Communication Patterns for Forest-of-Octrees AMR Codes
DESCRIPTION:Minisymposium\nComputer Science and Applied Mathematics, Physi
 cs, Solid Earth Dynamics\n\nDesign of Communication Patterns for Forest-of
 -Octrees AMR Codes\n\nBurstedde, Holke\n\nWe will discuss symmetric and no
 n-symmetric communication patterns that arise in forest-of-octrees paralle
 l adaptive mesh refinement (AMR). Here, symmetry means that each receiver 
 is also a sender to the sending process, and that both messages may overla
 p using asynchronous calls. One algorithm that is naturally symmetric is t
 he generation of one layer of ghost elements in order to inform applicatio
 ns about parallel neighbors. We will review the historic development of su
 ch a ghost algorithm up to the most recent, optimized incarnation. One alg
 orithm that can be made symmetric by less obvious means is the identificat
 ion of senders and receivers in partitioning a coarse mesh of trees. When 
 the forest connectivity is distributed in parallel, in addition to the ele
 ments that are distributed by design, any given tree may be partially owne
 d by multiple processes. On repartitioning the elements, the ghost trees m
 ust be updated in an m:n communication. We propose an optimal scheme that 
 sends as few messages and as little data as possible.
END:VEVENT
END:VCALENDAR