Deadline and Budget Constraint Based Task Scheduling Approach Using Modified PSO

Cloud computing enables users to access the online resource over the internet. Therefore, the efficient task scheduling approach should be designed to fulfil the user’s demands and achieve quality of service(QoS). In this paper, we present an improved task scheduling using particle swarm optimization (PSO) that aims to enhance the QoS. The tasks are modeled as discrete entities with specific QoS demands, and resources are specified by their distinct capacities to meet those demands. The proposed algorithm combines exploration and exploitation strategies to efficiently search the solution space based on constraints given for deadlines and budgets. Our contributions in this research will include the modification of an objective function that contains cost and execution time as the decision criteria. Our proposed algorithm DBPSO achieves 202 ms of makespan while DPSO obtains 233 ms of makespan for 250 tasks and 5 virtual machines.

Authors

Institutions

Publication Details

Published
2024-12-18
DOI
https://doi.org/10.1109/pdgc64653.2024.10984254
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deadline and Budget Constraint Based Task Scheduling Approach Using Modified PSO

Shashank Verma, Sanjeev Patel, Akanksha Tandon
Cloud Computing and Resource Management
article

Deadline and Budget Constraint Based Task Scheduling Approach Using Modified PSO

Shashank Verma, Sanjeev Patel, Akanksha Tandon
article en

Abstract

Cloud computing enables users to access the online resource over the internet. Therefore, the efficient task scheduling approach should be designed to fulfil the user’s demands and achieve quality of service(QoS). In this paper, we present an improved task scheduling using particle swarm optimization (PSO) that aims to enhance the QoS. The tasks are modeled as discrete entities with specific QoS demands, and resources are specified by their distinct capacities to meet those demands. The proposed algorithm combines exploration and exploitation strategies to efficiently search the solution space based on constraints given for deadlines and budgets. Our contributions in this research will include the modification of an objective function that contains cost and execution time as the decision criteria. Our proposed algorithm DBPSO achieves 202 ms of makespan while DPSO obtains 233 ms of makespan for 250 tasks and 5 virtual machines.

National Institute of Technology Rourkela (IN)
Openalex Percentile: Top 52%
Cloud Computing and Resource Management
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.