.png){kind=icon}
返回
Partitioning Tree-Shaped Task Graphs for Distributed Platforms With Limited Memory
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2020.2971200.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Scientific applications are commonly modeled as the processing of directed acyclic graphs of tasks, and for some of them, the graph takes the special form of a rooted tree. This tree expresses both the computational dependencies between tasks and their storage requirements. The problem of scheduling/traversing such a tree on a single processor to minimize its memory footprint has already been widely studied. The present article considers the parallel processing of such a tree and studies how to partition it for a homogeneous multiprocessor platform, where each processor is equipped with its own memory. We formally state the problem of partitioning the tree into subtrees, such that each subtree can be processed on a single processor (i.e., it must fit in memory), and the goal is to minimize the total resulting processing time. We prove that this problem is NP-complete, and we design polynomial-time heuristics to address it. An extensive set of simulations demonstrates the usefulness of these heuristics.
Keyword:
Scheduling
tree partitioning
memory-aware
makespan minimization
parallel computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
分享收藏Generation of Human iPSC-derived Neural Progenitor Cells (NPCs) as Drug Discovery Model for Neurological and Mitochondrial Disorders.png)
BIO-PROTOCOL
OAAI
BIO-PROTOCOLIF0
OAAI分享收藏
查看更多内容