BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:2.0
BEGIN:VEVENT
DTSTART:20151117T231500Z
DTEND:20151118T010000Z
LOCATION:Level 4 - Lobby
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Multi-scale computational methods are widely used for complex scientific computing problems that span multiple spatial and temporal scales. These problem meshes are decomposed into multiple subdomains that are solved independently at different timescales and granularity and then coupled back to get the desired solution. The computational cost associated with different scales can vary by multiple orders of magnitude. Hence the problem of finding an optimal mesh partitioning, choosing appropriate timescales for the partitions, and determining the number of partitions at each timescale is non-trivial. Existing partitioning tools, overlook the constraints posed by multi-scale methods, leading to sub-optimal partitions with a high performance penalty.=0AOur partitioning approach exploits domain knowledge to handle multi-scale problems appropriately and produces optimized mesh partitioning automatically. Our approach produce decompositions that perform as well as, if not better than, decompositions produced by state-of-the-art partitioners, like METIS, and even those that are manually constructed by domain scientists.
SUMMARY:Exploiting Domain Knowledge to Optimize Mesh Partitioning for Multi-Scale Methods
PRIORITY:3
END:VEVENT
END:VCALENDAR