Network-Aware HEFT Scheduling for Grid
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 comp...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/317284 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832562702439940096 |
|---|---|
| author | Muhammad Murtaza Yousaf Michael Welzl |
| author_facet | Muhammad Murtaza Yousaf Michael Welzl |
| author_sort | Muhammad Murtaza Yousaf |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-d3e0ff931da34b4490bbee0ec6b0d581 |
| institution | Kabale University |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-d3e0ff931da34b4490bbee0ec6b0d5812025-02-03T01:22:00ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/317284317284Network-Aware HEFT Scheduling for GridMuhammad Murtaza Yousaf0Michael Welzl1Punjab University College of Information Technology, University of the Punjab, Allama Iqbal (Old) Campus, Lahore, PakistanNetworks and Distributed Systems Group, Department of Informatics, University of Oslo, NorwayWe 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.http://dx.doi.org/10.1155/2014/317284 |
| spellingShingle | Muhammad Murtaza Yousaf Michael Welzl Network-Aware HEFT Scheduling for Grid The Scientific World Journal |
| title | Network-Aware HEFT Scheduling for Grid |
| title_full | Network-Aware HEFT Scheduling for Grid |
| title_fullStr | Network-Aware HEFT Scheduling for Grid |
| title_full_unstemmed | Network-Aware HEFT Scheduling for Grid |
| title_short | Network-Aware HEFT Scheduling for Grid |
| title_sort | network aware heft scheduling for grid |
| url | http://dx.doi.org/10.1155/2014/317284 |
| work_keys_str_mv | AT muhammadmurtazayousaf networkawareheftschedulingforgrid AT michaelwelzl networkawareheftschedulingforgrid |