返回
Memory-aware tree traversals with pre-assigned tasks
DOI:10.1016/j.jpdc.2014.10.004.png)
摘要
En 中文
We study the complexity of traversing tree-shaped workflows whose tasks require large I/O files. We target a heterogeneous architecture with two resource types, each with a different memory, such as a multicore node equipped with a dedicated accelerator (FPGA or GPU). The tasks in the workflow are colored according to their type and can be processed if all their input and output files can be stored in the corresponding memory. The amount of used memory of each type at a given execution step strongly depends upon the ordering in which the tasks are executed, and upon when communications between both memories are scheduled. The objective is to determine an efficient traversal that minimizes the maximum amount of memory of each type needed to traverse the whole tree. In this paper, we establish the complexity of this two-memory scheduling problem, and provide inapproximability results. In addition, we design several heuristics, based on both post-order and general traversals, and we evaluate them on a comprehensive set of tree graphs, including random trees as well as assembly trees arising in the context of sparse matrix factorizations. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Scheduling
Memory-aware
Sparse matrix factorization
Multifrontal method
Tree traversal
Bi-objective optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
Effect of Exercise Training on the Mental and Physical Well-Being of Caregivers for Persons Living With Chronic Illnesses: A Systematic Review and Meta-Analysis运动训练对慢性病患者照顾者身心健康的影响: 系统综述和荟萃分析
Dopamine Modulates Acetylcholine Release via Octopamine and CREB Signaling in Caenorhabditis elegans
PLoS ONE
IF0

