.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Parallel partitioning
Sequential assignment
Write-Only Architecture
Heterogeneous computing
High-performance computing
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
View more