.png){kind=icon}
返回
Parallel partitioning for distributed systems using sequential assignment
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2012.09.019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a method to combine the advantages of both task parallelism and fine-grained co-design specialisation to achieve faster execution times than either method alone on distributed heterogeneous architectures. The method uses a novel mixed integer linear programming formalisation to assign code sections from parallel tasks to share computational components with the optimal trade-off between acceleration from component specialism and serialisation delay. The paper provides results for software benchmarks partitioned using the method and formal implementations of previous alternatives to demonstrate both the practical tractability of the linear programming approach and the increase in program acceleration potential deliverable. (C) 2012 Elsevier Inc. All rights reserved.
Keyword:
Parallel partitioning
Sequential assignment
Write-Only Architecture
Heterogeneous computing
High-performance computing
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
分享收藏
Techniques for mapping tasks to machines in heterogeneous computing systems用于将任务映射到异构计算系统中的机器的技术
PREAI
分享收藏
查看更多内容