Greedy Performance Metrics for Grid Schedulers

TítuloGreedy Performance Metrics for Grid Schedulers
AutoresJ. L. Albín, T. F. Pena, J. C. Cabaleiro and F. F. Rivera
TipoComunicación para congreso
Fonte First International Conference on Parallel, Distributed and Grid Computing for Engineering, Pécs (Hungary), Civil-Comp Press, pp. 333-344 , 2009.
ISBN978-1-905088-29-4
ISSN1759-3433
DOI10.4203/ccp.90.23
AbstractThe most common metrics to analyse the effectiveness of schedulers from the user’s perspective are response time, waiting time and slowdown. These metrics are used to understand how good are the scheduling algorithms, and their main objective is to measure how quick the jobs are processed. However, these basic metrics are not fair for schedulers of grids and heterogeneous clusters. In this paper we introduce new metrics specially adapted to heterogeneous systems. They can be considered as a generalisation of the previous ones. The benefits and drawbacks of these metrics are also studied from both, theoretical and practical points of view.
Palabras chaveGrid computing, performance metrics