arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1111.1750cs.DScs.DCcs.NAmath.NA
收藏

近线性工作并行SDD求解器、低直径分解和低拉伸子图

Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs

Carnegie Mellon University(卡内基梅隆大学);University of Puerto Rico Rio Piedras(波多黎各大学里奥彼德拉斯分校)

Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan

AI总结:

提出一种近线性工作的并行算法求解对称对角占优线性系统,通过低直径分解生成低拉伸生成树或子图,实现高效并行求解。

摘要:

我们提出了一种近线性工作的并行算法的设计与分析,用于求解对称对角占优(SDD)线性系统。输入一个具有$m$个非零元的SDD $n imes n$矩阵$A$和一个向量$b$,我们的算法计算一个向量$ ilde{x}$,使得$ orm[A]{ ilde{x} - A^+b} \leq \vareps \cdot orm[A]{A^+b}$,工作量为$O(m\log^{O(1)}{n}\log{ rac1ε})$,深度为$O(m^{1/3+θ}\log rac1ε)$,其中$θ>0$任意固定。该算法依赖于一个并行算法来生成低拉伸生成树或生成子图。为此,我们首先开发了一个并行分解算法,在对数多项式深度和$\otilde(|E|)$工作量内,将图分解为具有对数多项式直径的组件,使得只有一小部分原始边位于组件之间。这可用于生成平均拉伸为$O(n^α)$的生成树,工作量为$O(n^{1+α})$,深度为$O(n^α)$。或者,它可用于生成平均拉伸为对数多项式的生成子图,工作量为$\otilde(|E|)$,深度为对数多项式。我们应用这个子图构造来推导一个并行线性系统求解器。通过在已知应用中使用该求解器,我们的结果为几个问题提供了改进的并行随机算法,包括单源最短路径、最大流、最小费用流和近似最大流。

英文摘要:

We present the design and analysis of a near linear-work parallel algorithm for solving symmetric diagonally dominant (SDD) linear systems. On input of a SDD $n$-by-$n$ matrix $A$ with $m$ non-zero entries and a vector $b$, our algorithm computes a vector $\tilde{x}$ such that $\norm[A]{\tilde{x} - A^+b} \leq \vareps \cdot \norm[A]{A^+b}$ in $O(m\log^{O(1)}{n}\log{\frac1ε})$ work and $O(m^{1/3+θ}\log \frac1ε)$ depth for any fixed $θ> 0$. The algorithm relies on a parallel algorithm for generating low-stretch spanning trees or spanning subgraphs. To this end, we first develop a parallel decomposition algorithm that in polylogarithmic depth and $\otilde(|E|)$ work, partitions a graph into components with polylogarithmic diameter such that only a small fraction of the original edges are between the components. This can be used to generate low-stretch spanning trees with average stretch $O(n^α)$ in $O(n^{1+α})$ work and $O(n^α)$ depth. Alternatively, it can be used to generate spanning subgraphs with polylogarithmic average stretch in $\otilde(|E|)$ work and polylogarithmic depth. We apply this subgraph construction to derive a parallel linear system solver. By using this solver in known applications, our results imply improved parallel randomized algorithms for several problems, including single-source shortest paths, maximum flow, minimum-cost flow, and approximate maximum flow.

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

↑