Abdul Aziz, Maslina, Abawajy, Jemal and Herawan, Tutut 2015, Layered workflow scheduling algorithm, in FUZZ-IEEE 2015 : Proceedings of the IEEE International Conference on Fuzzy Systems, IEEE, Piscataway, N.J., pp. 1-7, doi: 10.1109/FUZZ-IEEE.2015.7338091.
Workflow applications require workflow processing in which workflow tasks are processed based on their dependencies. With the emergency of complex distributed systems such as grids and clouds, efficient workflow scheduling (WFS) algorithms have become the core components of the workflow management systems (WfMS). Thus, WFS that allocates each task in the workflow to a relevant resource with the aim of improving system performance and end user satisfaction is fundamentally important. In this paper, we propose a new workflow scheduling algorithm called Layered Workflow Scheduling Algorithm (LWFS) for scheduling workflow applications. We studied the efficacy of the LWFS scheduling experimentally and compared its performance with approaches including Improved Critical Path using Descendant Prediction (ICPDP), Highest Level First with Estimated Time (HLFET), Modified Critical Path (MCP) and Earliest Time First (ETF). The results of the experiments show that the proposed approach outperforms other approaches.
Field of Research
080201 Analysis of Algorithms and Complexity
Socio Economic Objective
970108 Expanding Knowledge in the Information and Computing Sciences
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact email@example.com.