Table of Contents Author Guidelines Submit a Manuscript
Scientific Programming
Volume 13, Issue 2, Pages 93-112

Data Partitioning for Multiprocessors with Memory Heterogeneity and Memory Constraints

Alexey Lastovetsky and Ravi Reddy

Department of Computer Science University College Dublin, Belfield Dublin 4, Ireland

Received 1 December 2005; Accepted 1 December 2005

Copyright © 2005 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The paper presents a performance model that can be used to optimally distribute computations over heterogeneous computers. This model is application-centric representing the speed of each computer by a function of the problem size. This way it takes into account the processor heterogeneity, the heterogeneity of memory structure, and the memory limitations at each level of memory hierarchy. A problem of optimal partitioning of an n-element set over p heterogeneous processors using this performance model is formulated, and its efficient solution of the complexity O(p3× log2n) is given.