BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:1.0
BEGIN:VEVENT
DTSTART:20151117T231500Z
DTEND:20151118T010000Z
LOCATION:Level 4 - Lobby
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: Space Filling Curves (SFC) are commonly used by the HPC community for partitioning data[3, 4, 6] and for resource allocations[2, 5]. Amongst the various SFCs, Hilbert curves have been found to be in general superior to the more ubiquitous Morton or Z-Curve [3]. However, their adoption in large-scale HPC codes, especially for partitioning applications, has not been as common as Morton curves due to the computational complexity associated with the Hilbert ordering. In this work, we present an alternative algorithm for computing the Hilbert ordering that can be implemented almost as efficiently as the Morton ordering. Additionally, being based on the concept of the nearest common ancestor—a fundamental property of all SFCs—the algorithm can be applied to all SFCs. We also present comparisons of Morton and Hilbert curve based partitions for adaptive meshes using two partitioning schemes demonstrating the superiority=0Aof Hilbert ordering.
SUMMARY:Hilbert Curve Based Flexible Dynamic Partitioning Scheme for Adaptive Scientific Computations
PRIORITY:3
END:VEVENT
END:VCALENDAR