BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20250626T233526Z
LOCATION:B302-B305
DTSTART;TZID=America/New_York:20241120T100000
DTEND;TZID=America/New_York:20241120T170000
UID:submissions.supercomputing.org_SC24_sess533_post271@linklings.com
SUMMARY:Communication Hiding for Matrix-Free Finite Element Operators of a
  Complex PDE: Nonlinear Stokes Flow of Earth’s Mantle
DESCRIPTION:Max Heldman and Johann Rudi (Virginia Tech)\n\nFor large-scale
  matrix-free finite-element PDE solvers, parallel matrix-vector products t
 ypically comprise the dominant computational cost. Synchronization steps f
 or input and output, when degrees of freedom (DOFs) lying on inter-process
  boundaries are communicated, become the dominant serial portion of the pr
 ogram and the main scalability bottleneck. However, the cost of communicat
 ion can be mitigated if it can be overlapped with local computations which
  do not require the values of DOFs on process boundaries. In this research
 , we study the nonlinear Stokes solver of the mantle convection code Rhea,
  comparing several different methods for overlapping communication with co
 mputation during matrix-vector products, including a new dynamic method wh
 ich automatically adjusts to measured imbalances in communication waiting 
 times. We observe significant improvements in the waiting times, and in th
 e overall computation times, for the matrix-vector products in Rhea.\n\nRe
 gistration Category: Tech Program Reg Pass, Exhibits Reg Pass\n\nSession C
 hairs: Ayesha Afzal (Friedrich-Alexander University, Erlangen-Nuremberg; E
 rlangen National High Performance Computing Center); Sally Ellingson (Univ
 ersity of Kentucky); and Alan Sussman (University of Maryland)\n\n
END:VEVENT
END:VCALENDAR
