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.展开更多
基金十三五CRAFT项目(项目名称:Comprehensive Research Facility for Fusion Technology,项目审批代码:2018-000052-73-01-001228)合肥综合性国家科学中心能源研究院自主立项项目(项目名称:面向癌症治疗的紧凑型硼中子俘获治疗技术开发及产业应用,项目编号:21KZS202)。
基金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
