Data partitioning with a realistic performance model of networks of heterogeneous computers with task size limits

The paper presents a performance model that can be used to optimally schedule arbitrary tasks on a network of heterogeneous computers when there is an upper bound on the size of the task that can be solved by each computer. We formulate a problem of partitioning of an n-element set over p heterogeneous processors using this advanced performance model and give its efficient solution of the complexity O(p/sup 3/ /spl times/ log/sub 2/ n).