Proceedings of the 14th international conference on Architectural support for programming languages and operating systems
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Optimizing memory access on GPUs using morton order indexing
Proceedings of the 48th Annual Southeast Regional Conference
A new and effective hierarchical overlay structure for Peer-to-Peer networks
Computer Communications
| Hi-index | 14.98 |
Dilated integers form an ordered group of the Cartesian indices into a d\hbox{-}{\rm dimensional} array represented in the Morton order. Efficient implementations of its operations can be found elsewhere. This paper offers efficient casting (type)conversions to and from an ordinary integer representation. As the Morton order representation for 2D and 3D arrays attracts more users because of its excellent block locality, the efficiency of these conversions becomes important. They are essential for programmers who would use Cartesian indexing there. Two algorithms for each casting conversion are presented here, including to-and-from dilated integers for both d = 2 and d = 3. They fall into two families. One family uses newly compact table lookup, so the cache capacity is better preserved. The other generalizes better to all d, using processor-local arithmetic that is newly presented as abstract d\hbox{-}{\rm ary} and (d - 1)\hbox{-}{\rm ary} recurrences. Test results for two and three dimensions generally favor the former.