A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Dynamic Load Balancing of Parallel Computational Iterative Routines on Platforms with Memory Heterogeneity
[chapter]
2011
Lecture Notes in Computer Science
High performance of data-parallel applications on heterogeneous platforms can be achieved by partitioning the data in proportion to the speeds of processors. It has been proven that the speed functions built from a history of time measurements better reflect different aspects of heterogeneity of processors. However, existing data partitioning algorithms based on functional performance models impose some restrictions on the shape of speed functions, which are not always satisfied if we try to
doi:10.1007/978-3-642-21878-1_6
fatcat:h4hlt2ib7ngl3aorgcoozqlm5a