Network-Aware HEFT Scheduling for GridReportar como inadecuado

Network-Aware HEFT Scheduling for Grid - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

The Scientific World Journal - Volume 2014 2014, Article ID 317284, 13 pages -

Research Article

Punjab University College of Information Technology, University of the Punjab, Allama Iqbal Old Campus, Lahore, Pakistan

Networks and Distributed Systems Group, Department of Informatics, University of Oslo, Norway

Received 30 August 2013; Accepted 21 October 2013; Published 22 January 2014

Academic Editors: H.-E. Tseng and W. Zuo

Copyright © 2014 Muhammad Murtaza Yousaf and Michael Welzl. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We present a network-aware HEFT. The original HEFT does not take care of parallel network flows while designing its schedule for a computational environment where computing nodes are physically at distant locations. In the proposed mechanism, such data transfers are stretched to their realistic completion time. A HEFT schedule with stretched data transfers exhibits the realistic makespan of the schedule. It is shown how misleading a schedule can be if the impact of parallel data transfers that share a bottleneck is ignored. A network-aware HEFT can be used to yield a benefit for Grid applications.

Autor: Muhammad Murtaza Yousaf and Michael Welzl



Documentos relacionados