Thumbnail
Access Restriction
Subscribed

Author Wieczorek, Marek ♦ Fahringer, Thomas ♦ Prodan, Radu
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Abstract 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.
Description Affiliation: University of Innsbruck, Innsbruck, Austria (Wieczorek, Marek; Prodan, Radu; Fahringer, Thomas)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1999-06-01
Publisher Place New York
Journal ACM SIGMOD Record (SGMD)
Volume Number 34
Issue Number 3
Page Count 7
Starting Page 56
Ending Page 62


Open content in new tab

   Open content in new tab
Source: ACM Digital Library