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

具有块对角结构的线性规划的块最优集结

Optimal Aggregation of Blocks into Subproblems in Linear-Programs with Block-Diagonal-Structure

Deepak Ponvel Chermakani

摘要:

当可用并行处理单元的数目至少等于块的数目时,通过将线性规划分解为尽可能多的小尺寸子问题,每个块产生一个单独的子问题,最小化了具有块对角结构的线性规划的求解的挂钟时间.当并行处理能力受到限制时,情况就不一定如此了,这会导致多个子问题在同一个处理单元上串行求解。在这种情况下,最好将块聚合成更大的子问题。最佳的聚合策略取决于所使用的计算平台,并最大限度地减少平均情况下的运行时间的子问题。我们证明,当块大小不相等时,最优聚合是NP难的,而当块大小相等时,最优聚合可以在多项式时间内实现。

英文摘要:

Wall-clock-time is minimized for a solution to a linear-program with block-diagonal-structure, by decomposing the linear-program into as many small-sized subproblems as possible, each block resulting in a separate subproblem, when the number of available parallel-processing-units is at least equal to the number of blocks. This is not necessarily the case when the parallel processing capability is limited, causing multiple subproblems to be serially solved on the same processing-unit. In such a situation, it might be better to aggregate blocks into larger sized subproblems. The optimal aggregation strategy depends on the computing-platform used, and minimizes the average-case running time for the set of subproblems. We show that optimal aggregation is NP-hard when blocks are of unequal size, and that optimal aggregation can be achieved within polynomial-time when blocks are of equal size.

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

↑