Priority based parallel processing multi user multi task scheduling algorithm

Mobile Edge computing is one of the emerging fields in cloud environments where numerous user applications leverage a wide range of strong and powerful resources. To ensure optimal utilization, cloud computing resources such as storage, applications, and other services require effective management and scheduling. Managing resources is particularly challenging in scientific workflows, which involve extensive computations and interdependent operations. Task scheduling is the crucial challenge in this setup since the edge setup is migrated near to the user’s environment most of the computation is going to be handled by the edge server. Various algorithms and techniques have been proposed to address this issue. This paper explores a novel scheduling method for tasks offloaded by different users in a multi-user access computing paradigm. Also, the priority of the task is being considered while the tasks from mobile users are assigned to the data center. Considering the priority of the task, the tasks are being scheduled parallelly to the data centers. The completion time and the CPU utilization are extremely enhanced by using the proposed PBPPMUMTSA- Priority Based Parallel Processing Multi User Multi Task Scheduling Algorithm.

Authors

Institutions

Publication Details

Journal
THE SCIENTIFIC TEMPER
Published
2025-03-20
DOI
https://doi.org/10.58414/scientifictemper.2025.16.2.04
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Priority based parallel processing multi user multi task scheduling algorithm

E. George Dharma Prakash Raj, P. Hepsibah Kenneth
THE SCIENTIFIC TEMPER
Distributed and Parallel Computing Systems
article

Priority based parallel processing multi user multi task scheduling algorithm

E. George Dharma Prakash Raj, P. Hepsibah Kenneth
article en

Abstract

Mobile Edge computing is one of the emerging fields in cloud environments where numerous user applications leverage a wide range of strong and powerful resources. To ensure optimal utilization, cloud computing resources such as storage, applications, and other services require effective management and scheduling. Managing resources is particularly challenging in scientific workflows, which involve extensive computations and interdependent operations. Task scheduling is the crucial challenge in this setup since the edge setup is migrated near to the user’s environment most of the computation is going to be handled by the edge server. Various algorithms and techniques have been proposed to address this issue. This paper explores a novel scheduling method for tasks offloaded by different users in a multi-user access computing paradigm. Also, the priority of the task is being considered while the tasks from mobile users are assigned to the data center. Considering the priority of the task, the tasks are being scheduled parallelly to the data centers. The completion time and the CPU utilization are extremely enhanced by using the proposed PBPPMUMTSA- Priority Based Parallel Processing Multi User Multi Task Scheduling Algorithm.

THE SCIENTIFIC TEMPERVol. 16(02)
Bharathidasan University (IN)
Openalex Percentile: Top 92%
Distributed and Parallel Computing Systems
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.

Priority based parallel processing multi user multi task scheduling algorithm — E. George Dharma Prakash Raj, P. Hepsibah Kenneth · THE SCIENTIFIC TEMPER (2025) | TGRS Research Map | TGRS