Grid resource management: state of the art and future trends
Grid resource management: state of the art and future trends
Dynamic scheduling of scientific workflow applications on the grid: a case study
Proceedings of the 2005 ACM symposium on Applied computing
Specification of grid workflow applications with AGWL: an Abstract Grid Workflow Language
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
Real world workflow applications in the askalon grid environment
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Automatic Data Reuse in Grid Workflow Composition
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Semantically-Aided Data-Aware Service Workflow Composition
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Tackling the grid job planning and resource allocation problem using a hybrid evolutionary algorithm
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Negotiation-Based Scheduling of Scientific Grid Workflows Through Advance Reservations
Journal of Grid Computing
Hi-index | 0.00 |
Scheduling is a key concern for the execution of performance-driven Grid applications. In this paper we comparatively examine different existing approaches for scheduling of scientific workflow applications in a Grid environment. We evaluate three algorithms namely genetic, HEFT, and simple “myopic” and compare incremental workflow partitioning against the full-graph scheduling strategy. We demonstrate experiments using real-world scientific applications covering both balanced (symmetric) and unbalanced (asymmetric) workflows. Our results demonstrate that full-graph scheduling with the HEFT algorithm performs best compared to the other strategies examined in this paper.