首页>
外文OA文献
>Rectilinear partitioning of irregular data parallel computations
【2h】
Rectilinear partitioning of irregular data parallel computations
展开▼
机译:不规则数据并行计算的直线分割
展开▼
免费
页面导航
摘要
著录项
相似文献
相关主题
摘要
New mapping algorithms for domain oriented data-parallel computations, where the workload is distributed irregularly throughout the domain, but exhibits localized communication patterns are described. Researchers consider the problem of partitioning the domain for parallel processing in such a way that the workload on the most heavily loaded processor is minimized, subject to the constraint that the partition be perfectly rectilinear. Rectilinear partitions are useful on architectures that have a fast local mesh network. Discussed here is an improved algorithm for finding the optimal partitioning in one dimension, new algorithms for partitioning in two dimensions, and optimal partitioning in three dimensions. The application of these algorithms to real problems are discussed.
展开▼