Resource scheduling of workflow multi-instance migration based on the shuffled leapfrog algorithm

Purpose: When the workflow changed, resource scheduling optimization in the process of the current running instance migration has become a hot issue in current workflow flexible research; purpose of the article is to investigate the resource scheduling problem of workflow multi-instance migration. Design/methodology/approach: The time and cost relationships between activities and resources in workflow instance migration process are analyzed and a resource scheduling optimization model in the process of workflow instance migration is set up; Research is performed on resource scheduling optimization in workflow multi-instance migration, leapfrog algorithm is adopted to obtain the optimal resource scheduling scheme. An example is given to verify the validity of the model and the algorithm. Findings: Under the constraints of resource cost and quantity, an optimal resource scheduling scheme for workflow migration is found, ensuring a minimal running time and optimal cost. Originality/value: A mathematical model for resource scheduling of workflow multi-instance migration is built and the shuffled leapfrog algorithm is designed to solve the model.Peer Reviewe

A Scheduler based on Resource Competition for Parameter Sweep Workflow

Grid workflow scheduling has been a prevalent field of research in order to allocate scientific workflow tasks to grid resources. To actuate these grid workflow scheduling algorithms, schedulers need to be developed for grid workflow management systems. A scheduler is a component that gathers information, such as estimated execution times and lists of available grid resources, as inputs for scheduling algorithms. Once a grid schedule is generated, the scheduler uses it to allocate grid resources to the tasks in the workflow. This is even more complicated for parameter sweep workflow scheduling. As parameter sweep workflows are repeatedly executed a number of times with different inputs, to schedule them in parallel, the scheduler must be able to handle multiple workflow instances and multiple scheduling iterations. In this paper, we present a scheduling algorithm for parameter sweep workflows and suggest an implementation of a scheduler for parameter sweep workflows based on the algorithms. We highlight the implementation issues encountered in our experience of scheduler development