.png){kind=icon}
返回
Load-balancing spatially located computations using rectangular partitions
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2012.05.013.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (represented as a matrix of non-negative integers) into rectangles, such that the load of the most loaded rectangle (processor) is minimized. Since finding the optimal arbitrary rectangle-based partition is an NP-hard problem, we investigate particular classes of solutions: rectilinear, jagged and hierarchical. We present a new class of solutions called m-way jagged partitions, propose new optimal algorithms for m-way jagged partitions and hierarchical partitions, propose new heuristic algorithms, and provide worst case performance analyses for some existing and new heuristics. Moreover, the algorithms are tested in simulation on a wide set of instances. Results show that two of the algorithms we introduce lead to a much better load balance than the state-of-the-art algorithms. We also show how to design a two-phase algorithm that reaches different time/quality tradeoffs. (C) 2012 Elsevier Inc. All rights reserved.
Keyword:
Load balancing
Spatial partitioning
Optimal algorithms
Heuristics
Dynamic programming
Particle-in-cell
Mesh-based computation
Jagged partitioning
Rectilinear partitioning
Hierarchical partitioning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
A two-dimensional data distribution method for parallel sparse matrix-vector multiplication.png)
SIAM REVIEWOAAI
SIAM REVIEWIF6.1
OAAI分享收藏分享收藏分享收藏A load-balancing algorithm for a parallel electromagnetic particle-in-cell code一种并行电磁粒子单元代码的负载平衡算法
PREAI
分享收藏
查看更多内容