Optimizing locationing of multiple masters for master-worker grid applications

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Banino, C. (2006). Optimizing locationing of multiple masters for master-worker grid applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3732 LNCS, pp. 1041–1050). https://doi.org/10.1007/11558958_126

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free