Data partitioning for multiprocessors with memory heterogeneity and memory constraints

Authors:
Alexey Lastovetsky;Ravi Reddy
Affiliations:
Department of Computer Science University College Dublin, Belfield Dublin 4, Ireland. E-mail: {Alexey.Lastovetsky, Manumachu.Reddy}@ucd.ie;Department of Computer Science University College Dublin, Belfield Dublin 4, Ireland. E-mail: {Alexey.Lastovetsky, Manumachu.Reddy}@ucd.ie
Venue:
Scientific Programming - International Symposium of Parallel and Distributed Computing & International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogenous Networks
Year:
2005

Citing 15
Cited 5

An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster

IEEE Transactions on Parallel and Distributed Systems
A Proposal for a Heterogeneous Cluster ScaLAPACK (Dense Linear Solvers)

IEEE Transactions on Computers
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Dynamic Cluster Resource Allocations for Jobs with Known and Unknown Memory Demands

IEEE Transactions on Parallel and Distributed Systems
ScaLAPACK: A Portable Linear Algebra Library for Distributed Memory Computers - Design Issues and Performance

PARA '95 Proceedings of the Second International Workshop on Applied Parallel Computing, Computations in Physics, Chemistry and Engineering Science
Adaptive Computing on the Grid Using AppLeS

IEEE Transactions on Parallel and Distributed Systems
Linear Algebra Algorithms in Heterogeneous Cluster of Personal Computers

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Parallel Computing on Heterogeneous Networks

Parallel Computing on Heterogeneous Networks
Grid Harvest Service: A System for Long-Term, Application-Level Task Scheduling

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Simulation of Data Distribution Strategies for LU Factorization on Heterogeneous Machines

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Divisible Load Scheduling in Systems with Limited Memory

Cluster Computing
Memory Conscious Task Partition and Scheduling in Grid Environments

GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Data Partitioning with a Realistic Performance Model of Networks of Heterogeneous Computers with Task Size Limits

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
Design and Implementation of the ScaLAPACK LU, QR, and Cholesky Factorization Routines

Scientific Programming
Memory-constrained communication minimization for a class of array computations

LCPC'02 Proceedings of the 15th international conference on Languages and Compilers for Parallel Computing

Data Partitioning with a Functional Performance Model of Heterogeneous Processors

International Journal of High Performance Computing Applications
Data distribution for dense factorization on computers with memory heterogeneity

Parallel Computing
Distributed data partitioning for heterogeneous processors based on partial estimation of their functional performance models

Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
Two-dimensional matrix partitioning for parallel computing on heterogeneous processors based on their functional performance models

Euro-Par'09 Proceedings of the 2009 international conference on Parallel processing
Parallel Simulation of NEPs on Clusters

WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(p^{3}× log_{2} n) is given.