A2HA—automatic and adaptive host allocation in utility computing for bag-of-tasksReportar como inadecuado

A2HA—automatic and adaptive host allocation in utility computing for bag-of-tasks - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Journal of Internet Services and Applications

, Volume 2, Issue 2, pp 171–185

First Online: 27 August 2011Received: 08 November 2010Accepted: 26 July 2011


There are increasingly more computing problems requiring lengthy parallel computations. For those without access to current cluster or grid infrastructures, a recent and proven viable solution can be found with on-demand utility computing infrastructures, such as Amazon Elastic Compute Cloud EC2. A relevant class of such problems, Bag-of-Tasks BoT, can be easily deployed over such infrastructures to run on pools of virtual computers, if provided with suitable software for host allocation. BoT problems are found in several and relevant scenarios such as image rendering and software testing.

In BoT jobs, tasks are mostly independent; thus, they can run in parallel with no communication among them. The number of allocated hosts is relevant as it impacts both the speedup and the cost: if too many hosts are used, the speedup is high but this may not be cost-effective; if too few are used, the cost is low but speedup falls below expectations. For each BoT job, given that there is no prior knowledge of neither the total job processing time nor the time each task takes to complete, it is hard to determine the number of hosts to allocate. Current solutions e.g., bin-packing algorithms are not adequate as they require knowing in advance either the time that the next task will take to execute or, for higher efficiency, the time taken by each one of the tasks in each job considered.

Thus, we present an algorithm and heuristics that adaptively predicts the number of hosts to be allocated, so that the maximum speedup can be obtained while respecting a given predefined budget. The algorithm and heuristics were simulated against real and theoretical workloads. With the proposed solution, it is possible to obtain speedups in line with the number of allocated hosts, while being charged less than the predefined budget.

KeywordsCloud computing Scheduling heuristics Resource allocation Bag-of-tasks  Download to read the full article text

Autor: João Nuno Silva - Luís Veiga - Paulo Ferreira

Fuente: https://link.springer.com/


Documentos relacionados