arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1912.08045cs.CC
收藏

乘法混合算法的I/O复杂度

On the I/O complexity of hybrid algorithms for Integer Multiplication

Lorenzo De Stefani

摘要:

几乎渐近紧下界推导出的输入/输出(I/O)的复杂性$IO_\mathcal{A}\left(n,M\right)$的一般类的混合算法计算的产品的两个整数,每个表示与$n$数字在一个给定的基地$s$,在一个两级存储层次结构与$M$字的快速存储器,与不同的数字存储在不同的内存字。所考虑的混合算法将Toom-Cook- $k$(或Toom-$k$)快速整数乘法方法与计算复杂度$Θ\left(c_kn^{\log_k \left(2k-1\right)}\right)$和计算$Ω\left(n^2\right)$数字乘法的“标准”整数乘法算法相结合。给出了一类“均匀非平稳”混合算法I/O复杂度的$Ω\left(\left(n/\max\{M,n_0\}\right)^{\log_k \left(2k-1\right)}\left(\max\{1,n_0/M\}\right)^2M\right)$下界,其中$n_0$表示使用具有代数复杂度$Ω\left(n^2\right)$的标准算法计算的子问题的阈值大小.作为一种特殊情况,我们的结果产生了一个渐近紧$Θ\left(n^2/M\right)$下限的I/O复杂度的任何标准整数乘法算法。由于这一类的一些顺序混合算法的I/O成本在相应下界的$\mathcal{O}\left(k^2\right)$乘法项内,因此所提出的下界几乎是渐近紧的,并且对于$k$的常数值确实是紧的。通过扩展这些结果到分布式内存模型与$n_0$处理器,我们得到了内存相关和内存无关的I/O下界的并行版本的混合整数乘法算法。所有的下界推导出更一般的“非均匀,非平稳”的混合算法,允许递归调用有一个不同的结构。

英文摘要:

Almost asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity $IO_\mathcal{A}\left(n,M\right)$ of a general class of hybrid algorithms computing the product of two integers, each represented with $n$ digits in a given base $s$, in a two-level storage hierarchy with $M$ words of fast memory, with different digits stored in different memory words. The considered hybrid algorithms combine the Toom-Cook-$k$ (or Toom-$k$) fast integer multiplication approach with computational complexity $Θ\left(c_kn^{\log_k \left(2k-1\right)}\right)$, and "standard" integer multiplication algorithms which compute $Ω\left(n^2\right)$ digit multiplications. We present an $Ω\left(\left(n/\max\{M,n_0\}\right)^{\log_k \left(2k-1\right)}\left(\max\{1,n_0/M\}\right)^2M\right)$ lower bound for the I/O complexity of a class of "uniform, non-stationary" hybrid algorithms, where $n_0$ denotes the threshold size of sub-problems which are computed using standard algorithms with algebraic complexity $Ω\left(n^2\right)$. As a special case, our result yields an asymptotically tight $Θ\left(n^2/M\right)$ lower bound for the I/O complexity of any standard integer multiplication algorithm. As some sequential hybrid algorithms from this class exhibit I/O cost within a $\mathcal{O}\left(k^2\right)$ multiplicative term of the corresponding lower bounds, the proposed lower bounds are almost asymptotically tight and indeed tight for constant values of $k$. By extending these results to a distributed memory model with $n_0$ processors, we obtain both memory-dependent and memory-independent I/O lower bounds for parallel versions of hybrid integer multiplication algorithms. All the lower bounds are derived for the more general class of "non-uniform, non-stationary" hybrid algorithms that allow recursive calls to have a different structure.

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

↑