Data Partitioning with a Realistic Performance Model of Networks of Heterogeneous Computers with Task Size Limits

Authors:
Alexey Lastovetsky;Ravi Reddy
Affiliations:
-;-
Venue:
ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Year:
2004

Citing 0
Cited 6

Data Partitioning with a Functional Performance Model of Heterogeneous Processors

International Journal of High Performance Computing Applications
Data partitioning for multiprocessors with memory heterogeneity and memory constraints

Scientific Programming - International Symposium of Parallel and Distributed Computing & International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogenous Networks
Defining and controlling the heterogeneity of a cluster: The Wrekavoc tool

Journal of Systems and Software
Wrekavoc: a tool for emulating heterogeneity

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A variable group block distribution strategy for dense factorizations on networks of heterogeneous computers

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
A novel algorithm of optimal matrix partitioning for parallel dense factorization on heterogeneous processors

PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 0(p^3 x\log _2 n).