Optimizing locationing of multiple masters for master-worker grid applications

Authors:
Cyril Banino
Affiliations:
Department of Computer and Information Science (IDI), Norwegian University of Science and Technology (NTNU), Trondheim, Norway
Venue:
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Year:
2004

Citing 9
Cited 0

A parallel computing approach to genetic sequence comparison: the master-worker paradigm with interworker communication

Computers and Biomedical Research
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
SETI@home: an experiment in public-resource computing

Communications of the ACM
Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Master/Slave Computing on the Grid

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Entropia: architecture and performance of an enterprise desktop grid system

Journal of Parallel and Distributed Computing - Special issue on computational grids
Data Replication Strategies in Grid Environments

ICA3PP '02 Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms

IEEE Transactions on Parallel and Distributed Systems
The master-slave paradigm with heterogeneous processors

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of allocating a large number of independent tasks to a heterogeneous computing platform is considered. A non oriented graph is used to model a Grid, where resources can have different speeds of computation and communication. We claim that the use of multiple masters is necessary to achieve good performance on large-scale platforms. The problem considered is to find the most profitable master locations in order to optimize the platform throughput.