SFCGen
SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion. Because they are continuous and self-similar, space-filling curves have been widely used in mathematics to transform multi-dimensional problems into one-dimensional forms. For scientific applications, reordering computation by certain space-filling curves can significantly improve data reuse because of the locality properties of these curves. However, when space-filling curves are used in programs for reordering data, traversal or indexing of the curves must be efficient.par To address this problem, we present the table-driven framework SFCGen to efficiently generate multi-dimensional space-filling curves on the fly. The framework is general and easy enough to be used in any application that can be partitioned recursively in multiple dimensions. We describe a movement specification table, a universal turtle algorithm to enumerate points along a space-filling curve, a table-based indexing algorithm to transform coordinates of a point into its position along the curve and an algorithm to pregenerate the table automatically.par As examples, we show how high-dimensional Hilbert, Morton, and Peano curves and a two-dimensional Sierpiński curve can be generated with our algorithms. We present performance results for Hilbert, Morton, and Peano curves and compare the efficiency of our curve generation algorithm with the most recent work on generating Hilbert curves. Our experimental results on three modern microprocessor-based platforms show that SFCGen performs up to 63% faster than the most recent recursive algorithm on 2D curve generation and up to a factor of 132 faster than two previous byte-oriented non-recursive implementations. On curve indexing, SFCGen performs as much as a factor of three faster than the byte-oriented implementation. Our results on 4D space-filling curves also show that SFCGen scales very well with curve level for higher dimensional spaces.
(Source: http://dl.acm.org/)
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 5 articles , 1 standard article )
Showing results 1 to 5 of 5.
Sorted by year (- Schreiber, Martin; Neckel, Tobias; Bungartz, Hans-Joachim: Evaluation of an efficient stack-RLE clustering concept for dynamically adaptive grids (2016)
- Konrad, Christian: Two-constraint domain decomposition with space filling curves (2011)
- Padmanabhan, Anand; Ghosh, Sukumar; Wang, Shaowen: A self-organized grouping (SOG) framework for efficient grid resource discovery (2010)
- Hamilton, Chris H.; Rau-Chaplin, Andrew: Compact Hilbert indices: space-filling curves for domains with unequal side lengths (2008)
- Jin, Guohua; Mellor-Crummey, John: SFCGen: A framework for efficient generation of multi-dimensional space-filling curves by recursion (2005)