Generation and Proliferation of Random Directed Acyclic Graphs for Workflow Scheduling Problem
Indrajeet Gupta, Anubhav Choudhary, Prasanta K. Jana · 2017
Planning and scheduling of the workflow applications have always been a burning issue for the research community of the various fields. Researchers often need to evaluate their proposed workflow scheduling algorithm with the help of some benchmark as well as synthetic workflows. However, they face the problem of generating complex and large workflow by using a set of the parameters. In this paper, we present an algorithm to generate the random workflow applications based on the various parameters including the load distribution of the task nodes, connecting edge probability and the workflow shape, etc. We deal with the categorization of the workflow types based on the communication to computation ratio (CCR) which describes the nature of the workflow application. We also present two different file formats of workflow output, which are treated as the input to implement and validate the various scheduling algorithms.