Critical-Path and Priority based Algorithms for Scheduling Workflows with Parameter Sweep Tasks on Global Grids
Computer Architecture and High Performance Computing, Symposium on (2005)
Rio de Janeiro, Brazil
Oct. 24, 2005 to Oct. 27, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CAHPC.2005.22
Tianchi Ma , University of Melbourne, Australia
Rajkumar Buyya , University of Melbourne, Australia
Parameter-sweep has been widely adopted in large numbers of scientific applications. Parameter-sweep features need to be incorporated into Grid workflows so as to increase the scale and scope of such applications. New scheduling mechanisms and algorithms are required to provide optimized policy for resource allocation and task arrangement in such a case. This paper addresses scheduling sequential parameter-sweep tasks in a fine-grained manner. The optimization is produced by pipelining the subtasks and dispatching each of them onto well-selected resources. Two types of scheduling algorithms are discussed and customized to adapt the characteristics of parameter-sweep, as well as their effectiveness has been compared under multifarious scenarios.
T. Ma and R. Buyya, "Critical-Path and Priority based Algorithms for Scheduling Workflows with Parameter Sweep Tasks on Global Grids," Computer Architecture and High Performance Computing, Symposium on(SBAC-PAD), Rio de Janeiro, Brazil, 2005, pp. 251-258.