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

梯形的并行计算

Parallel computation of echelon forms

Jean-Guillaume Dumas, Thierry Gautier, Clément Pernet, Ziad Sultan

摘要:

我们提出了有效的并行算法和实现共享内存架构上的LU分解有限域。与相应的数值例程相比,我们已经确定了有限域上线性代数特有的三个主要困难。首先,算术复杂度可以由模约简支配。因此,在混合平铺迭代和递归算法的细粒度并行化时,必须尽可能多地延迟这些约简。第二,快速线性代数变体,例如,使用Strassen-Winograd算法,从来没有遭受不稳定性,因此可以广泛使用的级联与经典算法。在那里,要在块的大小之间进行权衡,这些块的大小非常适合那些快速变体或负载和通信平衡。第三,有限域上的许多应用需要矩阵的秩分布(经常是秩亏的),而不是线性系统的解。因此,重要的是设计并行算法,保持和计算这个排名的档案。此外,由于仅在算法期间发现秩分布,因此块大小必须是动态的。我们提出并比较了几种块分解:瓦片迭代与左看,右看和克劳特变种,板坯和瓦片递归。实验表明,瓦片递归变体的性能更好,并与参考数值软件的性能时,没有秩亏发生。此外,即使在最异构的情况下,即当所有的枢轴块的秩亏,我们表明,它是可能的,以保持高效率。

英文摘要:

We propose efficient parallel algorithms and implementations on shared memory architectures of LU factorization over a finite field. Compared to the corresponding numerical routines, we have identified three main difficulties specific to linear algebra over finite fields. First, the arithmetic complexity could be dominated by modular reductions. Therefore, it is mandatory to delay as much as possible these reductions while mixing fine-grain parallelizations of tiled iterative and recursive algorithms. Second, fast linear algebra variants, e.g., using Strassen-Winograd algorithm, never suffer from instability and can thus be widely used in cascade with the classical algorithms. There, trade-offs are to be made between size of blocks well suited to those fast variants or to load and communication balancing. Third, many applications over finite fields require the rank profile of the matrix (quite often rank deficient) rather than the solution to a linear system. It is thus important to design parallel algorithms that preserve and compute this rank profile. Moreover, as the rank profile is only discovered during the algorithm, block size has then to be dynamic. We propose and compare several block decomposition: tile iterative with left-looking, right-looking and Crout variants, slab and tile recursive. Experiments demonstrate that the tile recursive variant performs better and matches the performance of reference numerical software when no rank deficiency occur. Furthermore, even in the most heterogeneous case, namely when all pivot blocks are rank deficient, we show that it is possbile to maintain a high efficiency.

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

↑