BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260522T150110Z
LOCATION:C2/3/4 Ballroom
DTSTART;TZID=America/Chicago:20181114T083000
DTEND;TZID=America/Chicago:20181114T170000
UID:submissions.supercomputing.org_SC18_sess323_post179@linklings.com
SUMMARY:A Low-Communicaton Method to Solve Poisson's Equation on Locally-S
 tructured Grids
DESCRIPTION:Brian Van Straalen, Peter McCorquodale, and Phil Colella (Lawr
 ence Berkeley National Laboratory) and Christos Kavouklis (Lawrence Liverm
 ore National Laboratory)\n\nThis poster describes a new algorithm, Method 
 of Local Corrections (MLC), and a high-performance implementation for solv
 ing Poisson's equation with infinite-domain boundary conditions, on locall
 y-refined nested rectangular grids.  The data motion is comparable to that
  of only a single V-cycle of multigrid, and hence is an order of magnitude
  smaller than traditional multigrid iteration. The computational kernels a
 re 3D FFTs on small domains. Strong scaling tests on 64 to 4096 cores on N
 ERSC Cori I (Haswell) show over 60% efficiency, and weak scaling by replic
 ation tests over 64 to 32768 cores show 92% efficiency on the same platfor
 m. We find comparable solve times between HPGMG on a uniform grid with one
  billion grid points, and MLC on the same number of grid points adaptively
  distributed.  MLC is designed for AMR, able to solve problems with much h
 igher resolution at the finest level than an algorithm on a uniform grid.\
 n\nRegistration Category: Tech Program Reg Pass, Exhibits Reg Pass\n\n
END:VEVENT
END:VCALENDAR