title: Network-aware HEFT scheduling for grid.
abstract: 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.
authors.affiliation: Punjab University College of Information Technology, University of the Punjab, Allama Iqbal (Old) Campus, Lahore, Pakistan.
authors.forename: Muhammad Murtaza
authors.identifier: 0000-0001-9578-8811
authors.initials: MM
authors.lastname: Yousaf
authors.affiliation: Networks and Distributed Systems Group, Department of Informatics, University of Oslo, Norway.
authors.forename: Michael
authors.identifier: 0000-0001-8179-599X
authors.initials: M
authors.lastname: Welzl
mesh_terms: D033181:Information Dissemination; D020407:Internet; D008962:Models, Theoretical