A Multi-Objective JAYA-Based Workflow Scheduling in Fog-Cloud Computing Environment

The rapid growth of cloud-fog computing has introduced significant challenges in improving system performance and resource efficiency for dependent tasks. The inherent complexity and variability of tasks, coupled with fluctuating resource availability, make it difficult to identify an optimal scheduling algorithm. This study addresses these challenges by proposing a novel multi-objective optimization workflow scheduling approach based on the JAYA algorithm. The proposed method effectively tackles the complexities of scheduling within a distributed computing framework by integrating both fog and cloud resources. The approach aims to simultaneously minimize key performance metrics such as makespan, energy consumption, and cost, thereby enhancing overall system performance through optimized task allocation across heterogeneous resources. The Simulations conducted using the FogWorkflowSim toolkit compare the proposed approach with established algorithms, including Ant Colony Optimization (ACO), and Particle Swarm Optimization (PSO). The results demonstrate the superiority of the JAYA algorithm in achieving enhanced time efficiency, energy savings, and cost reduction. These findings highlight its significant contribution to advancing cloud-fog resource management by providing a robust framework for multi-objective optimization in workflow scheduling scenarios.

Authors

Institutions

Publication Details

Journal
Procedia Computer Science
Published
2025-01-01
DOI
https://doi.org/10.1016/j.procs.2025.03.324
Citations
5
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
16.23
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Multi-Objective JAYA-Based Workflow Scheduling in Fog-Cloud Computing Environment

Gur Mauj Saran Srivastava, Saiyam Varshney
5 citations
Procedia Computer Science
Cloud Computing and Resource Management
16.23
article

A Multi-Objective JAYA-Based Workflow Scheduling in Fog-Cloud Computing Environment

Gur Mauj Saran Srivastava, Saiyam Varshney
article en
5 citations

Abstract

The rapid growth of cloud-fog computing has introduced significant challenges in improving system performance and resource efficiency for dependent tasks. The inherent complexity and variability of tasks, coupled with fluctuating resource availability, make it difficult to identify an optimal scheduling algorithm. This study addresses these challenges by proposing a novel multi-objective optimization workflow scheduling approach based on the JAYA algorithm. The proposed method effectively tackles the complexities of scheduling within a distributed computing framework by integrating both fog and cloud resources. The approach aims to simultaneously minimize key performance metrics such as makespan, energy consumption, and cost, thereby enhancing overall system performance through optimized task allocation across heterogeneous resources. The Simulations conducted using the FogWorkflowSim toolkit compare the proposed approach with established algorithms, including Ant Colony Optimization (ACO), and Particle Swarm Optimization (PSO). The results demonstrate the superiority of the JAYA algorithm in achieving enhanced time efficiency, energy savings, and cost reduction. These findings highlight its significant contribution to advancing cloud-fog resource management by providing a robust framework for multi-objective optimization in workflow scheduling scenarios.

Procedia Computer ScienceVol. 259
Dayalbagh Educational Institute (IN)
Industry, innovation and infrastructure
Openalex Percentile: Top 1%
Cloud Computing and Resource Management
16.23
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.