Designing a Switching Based Workflow Scheduling Framework for Networked Environments

Due to the dynamics of the power of resources in non-dedicated computing environments such as Grid, and on the other hand, the autonomy of these environments and, consequently, the impossibility of repeating the operating scenarios to compare the algorithms created in this context, creating an environment by providing such conditions is necessary. In this paper, a framework for evaluating workflow-scheduling algorithms has been created, focusing on the dynamics of the power of resources in distributed environments. This framework based on a switching model that is capable of considering the change in the processing power of resources with high precision. Using the ability of this framework, the effectiveness of several different workflow scheduling algorithms has been evaluated.