Fuzzy-based Security-Driven Optimistic Scheduling of Scientific Workflows in Cloud Computing. Issue 2 (3rd March 2020)

• Record Type: Journal Article
• Authors: Angela Jennifa Sujana, J.; Revathi, T.; Joshua Rajanayagam, S.
• Is Part Of: IETE journal of research. Volume 66:Issue 2(2020)
• Page Start: 224
• Page End: 241
• Publication Date: 2020-03-03
• Subjects: Cloud computing -- Fuzzy model -- Workflow scheduling; Electronics -- Periodicals; Telecommunication -- Periodicals; Electronics; Telecommunication; Periodicals; 621.38
• DOI: 10.1080/03772063.2018.1486740
• Languages: English
• ISSNs: 0377-2063

Abstract

ABSTRACT: Cloud computing is a new computing paradigm which is gaining wide acceptance among scientific fraternity in the recent years. The services of cloud could be effectively used for running large-scale data and computation-intensive scientific workflow applications. Finding the optimal schedule for such workflows has been a major concern among the cloud users. In the present work, a novel approach of combining both optimization of the schedule along with the allocation of the virtual machines (VMs) based on security requirements is envisaged. This paper focuses on generating an optimized schedule for the complex workflow structures. The main objective of the schedule is to minimize the makespan of the schedule. In this paper, we design the scheduling heuristic based on the cost prediction matrix (CPM) for optimized cost calculation. The CPM will estimate the execution cost by considering the child's child task also. This leads to a prophetic estimation on the available VMs. In addition to this, we have used a fuzzy-based decision model for deciding the selection of the VMs based on security constraints in the cloud. This fuzzy model is combined with the optimized cost calculation from CPM for each and every task of the workflow. The proposed secured cost prediction-based scheduling (SCPS) algorithm then schedules the task in the best possible VM, so that the makespan is minimized. Our results show that the newly developed SCPS algorithm yields efficient schedule compared to other existing scheduling models in spite of the inclusion of security constraints besides scheduling. Nevertheless, this secured scheduling is done without much increase in the time complexity.