期刊
IEEE TRANSACTIONS ON COMPUTERS
卷 57, 期 4, 页码 567-573出版社
IEEE COMPUTER SOC
DOI: 10.1109/TC.2007.70814
关键词
analysis; programming techniques; numerical algorithms; design; performance; memory hierarchy; caches; paging; compilers; classes; quadtrees; octrees; dilation; contraction.
Dilated integers form an ordered group of the Cartesian indices into a d-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-ary and (d-1)-ary recurrences. Test results for two and three dimensions generally favor the former.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据