arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1310.6008cs.CCcs.DMmath.GR
收藏

置换群中的无记忆计算

Computing in permutation groups without memory

Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau

摘要:

无记忆计算是一种新的计算技术,它通过每次更新一个寄存器来计算一组寄存器中的任何函数,而不使用存储器。它的目的是模拟如何在现代核心中执行计算,因为它们通常涉及单个寄存器的更新。无记忆计算模型可以完全用变换半群来表示,或者在双射函数的情况下,用置换群来表示。在本文中,我们考虑如何有效地排列可以计算没有内存。我们确定计算任何置换或任何偶置换所需的基本更新的最小数量。所需的指令数量很少,这表明可以在内核上编码非常小的指令集来执行无记忆计算。然后,我们开始考虑在指令集的大小和结果程序的长度之间可能的折衷。我们认为更新只涉及有限数量的登记册。特别是,我们表明,二进制指令是不足以计算所有的排列时,没有内存的字母表大小是偶数。这些结果虽然表示为对称群或交错群的特殊生成集的性质,但为无记忆计算的实现提供了指导。

英文摘要:

Memoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically involve updates of single registers. The memoryless computation model can be fully expressed in terms of transformation semigroups, or in the case of bijective functions, permutation groups. In this paper, we consider how efficiently permutations can be computed without memory. We determine the minimum number of basic updates required to compute any permutation, or any even permutation. The small number of required instructions shows that very small instruction sets could be encoded on cores to perform memoryless computation. We then start looking at a possible compromise between the size of the instruction set and the length of the resulting programs. We consider updates only involving a limited number of registers. In particular, we show that binary instructions are not enough to compute all permutations without memory when the alphabet size is even. These results, though expressed as properties of special generating sets of the symmetric or alternating groups, provide guidelines on the implementation of memoryless computation.

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

↑