Z-curve’s encoding and decoding algorithms are primely important in many Z-curve-based applications.The bit interleaving algorithm is the current state-of-the-art algorithm for encoding and decoding Z-curve.Although ...Z-curve’s encoding and decoding algorithms are primely important in many Z-curve-based applications.The bit interleaving algorithm is the current state-of-the-art algorithm for encoding and decoding Z-curve.Although simple,its efficiency is hindered by the step-by-step coordinate shifting and bitwise operations.To tackle this problem,we first propose the efficient encoding algorithm LTFe and the corresponding decoding algorithm LTFd,which adopt two optimization methods to boost the algorithm’s efficiency:1)we design efficient lookup tables(LT)that convert encoding and decoding operations into table-lookup operations;2)we design a bit detection mechanism that skips partial order of a coordinate or a Z-value with consecutive 0s in the front,avoiding unnecessary iterative computations.We propose order-parallel and point-parallel OpenMP-based algorithms to exploit the modern multi-core hardware.Experimental results on discrete,skewed,and real datasets indicate that our point-parallel algorithms can be up to 12.6×faster than the existing algorithms.展开更多
将OpenMP并行运算库和Intel Math Kernel Library10.2科学计算库运用到高阶地球重力场反演,显著提高了计算效率。模拟结果表明:1)在以单历元为解算单元形成子法方程系数矩阵时,OpenMP可下三角压缩存储,其内存销耗和时间销耗均比较小;2)...将OpenMP并行运算库和Intel Math Kernel Library10.2科学计算库运用到高阶地球重力场反演,显著提高了计算效率。模拟结果表明:1)在以单历元为解算单元形成子法方程系数矩阵时,OpenMP可下三角压缩存储,其内存销耗和时间销耗均比较小;2)当利用多个历元组成高维系数矩阵,然后再形成法方程时,MKL算法才能体现出高效性能;3)MKL求逆算法效率远高于OpenMP算法;4)综合利用OpenMP和MKL算法的优势,可显著提高高阶地球重力场反演的效率。展开更多
基金funded by the Key Project of the Open Fund for Computer Technology Applications in Yunnan under Grant no.CB23031D025A.
文摘Z-curve’s encoding and decoding algorithms are primely important in many Z-curve-based applications.The bit interleaving algorithm is the current state-of-the-art algorithm for encoding and decoding Z-curve.Although simple,its efficiency is hindered by the step-by-step coordinate shifting and bitwise operations.To tackle this problem,we first propose the efficient encoding algorithm LTFe and the corresponding decoding algorithm LTFd,which adopt two optimization methods to boost the algorithm’s efficiency:1)we design efficient lookup tables(LT)that convert encoding and decoding operations into table-lookup operations;2)we design a bit detection mechanism that skips partial order of a coordinate or a Z-value with consecutive 0s in the front,avoiding unnecessary iterative computations.We propose order-parallel and point-parallel OpenMP-based algorithms to exploit the modern multi-core hardware.Experimental results on discrete,skewed,and real datasets indicate that our point-parallel algorithms can be up to 12.6×faster than the existing algorithms.
基金国家自然科学基金(6092106261003087)+2 种基金国家"八六三"高技术研究发展计划项目基金(2009AA01Z102)资助support by the National Natural Science Foundation of Chinawith the project #60621003
文摘将OpenMP并行运算库和Intel Math Kernel Library10.2科学计算库运用到高阶地球重力场反演,显著提高了计算效率。模拟结果表明:1)在以单历元为解算单元形成子法方程系数矩阵时,OpenMP可下三角压缩存储,其内存销耗和时间销耗均比较小;2)当利用多个历元组成高维系数矩阵,然后再形成法方程时,MKL算法才能体现出高效性能;3)MKL求逆算法效率远高于OpenMP算法;4)综合利用OpenMP和MKL算法的优势,可显著提高高阶地球重力场反演的效率。
