arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.5468cs.DS
收藏

括号法的广义实现

Broadword Implementation of Parenthesis Queries

Sebastiano Vigna

摘要:

我们继续在“排名/选择的广义实现”中开始的研究路线,提出广义(a.k.a. SWAR,“SIMD内寄存器”)算法,用于找到匹配的闭括号和第k个远闭括号。我们的算法工作在时间O(log w)的一个字的w位,不包含分支和测试指令。在64位(和更宽的)架构上,这些算法可以避免昂贵的制表,同时相对于for循环实现提供非常显著的加速。

英文摘要:

We continue the line of research started in "Broadword Implementation of Rank/Select Queries" proposing broadword (a.k.a. SWAR, "SIMD Within A Register") algorithms for finding matching closed parentheses and the k-th far closed parenthesis. Our algorithms work in time O(log w) on a word of w bits, and contain no branch and no test instruction. On 64-bit (and wider) architectures, these algorithms make it possible to avoid costly tabulations, while providing a very significant speedup with respect to for-loop implementations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑