An Improved Multi-Objective Workflow Scheduling Using F-NSPSO with Fuzzy Rules

被引:4
作者
Soma, Prathibha [1 ]
Latha, B. [2 ]
Vijaykumar, V. [3 ]
机构
[1] Sri Sai Ram Engn Coll, Dept Informat Technol, Chennai, Tamil Nadu, India
[2] Sri Sai Ram Engn Coll, Dept Comp Sci & Engn, Chennai, Tamil Nadu, India
[3] Univ New South Wales, Sch Comp Sci & Engn, Sydney, NSW, Australia
关键词
Scientific workflows; Cloud computing; Fuzzy rules; Particle swarm optimization; Energy efficiency; Makespan;
D O I
10.1007/s11277-022-09526-z
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
A lot of scientific problems in various domains from modelling sky as mosaics to understanding Genome sequencing in biological applications are modelled as workflows with a large number of interconnected tasks. Even though many works are cited in the literature on workflow scheduling, most of the existing works are focused on reducing the makespan alone. Moreover, energy efficiency is considered only in a few works included in the literature. Constraints about the dynamic workload allocation are not introduced in the existing systems. Moreover, the optimization techniques used in the existing systems have improved the QoS with little scalability in the cloud environment since they consider only the infrastructure as the service model. In this work, a new algorithm has been proposed based on the proposal of a new Multi-Objective Optimization model called F-NSPSO using NSPSO Meta-heuristics. This method allows the user to choose a suitable configuration dynamically. When compared to NSPSO an energy reduction of at least 10% has been observed for F-NSPSO for Montage, Cybershake, and Epigenomics workflow applications. Compared to the NSPSO algorithm F-NSPSO algorithm shows at least 13%, 12%, and 21% improvement in average makespan for Montage, Cybershake, and Epigenomics workflow applications respectively.
引用
收藏
页码:3567 / 3589
页数:23
相关论文
共 50 条
[41]   A Modified Black Hole-Based Multi-Objective Workflow Scheduling Improved Using the Priority Queues for Cloud Computing Environment [J].
Ebadifard, Fatemeh ;
Babamir, Seyed Morteza .
2018 4TH INTERNATIONAL CONFERENCE ON WEB RESEARCH (ICWR), 2018, :162-167
[42]   Multi-objective workflow optimization strategy (MOWOS) for cloud computing [J].
J. Kok Konjaang ;
Lina Xu .
Journal of Cloud Computing, 10
[43]   CP-PGWO: multi-objective workflow scheduling for cloud computing using critical path [J].
Saeed Doostali ;
Seyed Morteza Babamir ;
Maryam Eini .
Cluster Computing, 2021, 24 :3607-3627
[44]   Multi-objective workflow scheduling scheme: a multi-criteria decision making approach [J].
Madhu Sudan Kumar ;
Abhinav Tomar ;
Prasanta K. Jana .
Journal of Ambient Intelligence and Humanized Computing, 2021, 12 :10789-10808
[45]   Multi-objective workflow scheduling scheme: a multi-criteria decision making approach [J].
Kumar, Madhu Sudan ;
Tomar, Abhinav ;
Jana, Prasanta K. .
JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2021, 12 (12) :10789-10808
[46]   Multi-objective workflow scheduling in cloud computing: trade-off between makespan and cost [J].
Belgacem, Ali ;
Beghdad-Bey, Kadda .
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2022, 25 (01) :579-595
[47]   Multi-objective workflow scheduling in cloud computing: trade-off between makespan and cost [J].
Ali Belgacem ;
Kadda Beghdad-Bey .
Cluster Computing, 2022, 25 :579-595
[48]   Multi-objective Fuzzy Job-shop of Pharmaceutical Enterprise Scheduling Considering Uncertain and Multi-objective Features [J].
Zhong, Zufeng ;
Yang, Hongyan ;
Ye, Caihong ;
Yang, Man .
EKOLOJI, 2019, 28 (107) :2301-2311
[49]   MOWS: Multi-objective workflow scheduling in cloud computing based on heuristic algorithm [J].
Abazari, Farzaneh ;
Analoui, Morteza ;
Takabi, Hassan ;
Fu, Song .
SIMULATION MODELLING PRACTICE AND THEORY, 2019, 93 :119-132
[50]   Multi-Objective Task and Workflow Scheduling Approaches in Cloud Computing: a Comprehensive Review [J].
Hosseinzadeh, Mehdi ;
Ghafour, Marwan Yassin ;
Hama, Hawkar Kamaran ;
Vo, Bay ;
Khoshnevis, Afsane .
JOURNAL OF GRID COMPUTING, 2020, 18 (03) :327-356