BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20131120T001500Z
DTEND:20131120T020000Z
LOCATION:Mile High Pre-Function
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Time-parallel methods for the integration of time-dependent problems introduce concurrency in the temporal direction in addition to typically used parallelization in space.=0AA recently developed algorithm of this type is the "parallel full approximation scheme in space and time" (PFASST).=0APFASST performs "sweeps" with a low-order time stepper along a hierarchy of space-time meshes, iteratively computing a collocation solution on multiple time-slices simultaneously.=0AFor improved parallel efficiency, an FAS correction allows to use space-time coarsening strategies and thus to reduce the computational cost of sweeps on higher levels.=0AThe poster presents novel scaling results of a combination of PFASST with a parallel multi-grid (PMG) solver in space on up to the full IBM Blue Gene/Q system JUQUEEN with 448K cores.=0AIt is demonstrated that for large core counts the space-time parallel solver consisting of PFASST plus PMG features significantly better strong scaling capabilities than the pure space-parallel PMG code alone.
SUMMARY:Extreme-Scale Space-Time Parallelism
PRIORITY:3
END:VEVENT
END:VCALENDAR