Priority based parallel processing multi user multi task scheduling algorithm
Downloads
Published
DOI:
https://doi.org/10.58414/SCIENTIFICTEMPER.2025.16.2.04Keywords:
Task scheduling, Multi User, Parallel Processing, Edge server, Data centreDimensions Badge
Issue
Section
License
Copyright (c) 2025 The Scientific Temper

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
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.Abstract
How to Cite
Downloads
Similar Articles
- R. Selvakumar, A. Manimaran, Janani G, K.R. Shanthy, Design and development of artificial intelligence assisted railway gate controlling system using internet of things , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- N.S.G. Ganesh, V Arulkumar, R. Lathamanju, Priscilla Joy , Energetic and highly reliable photovoltaic power source assisted water pump control system design using IoT , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- P. Pattunnarajam, Janani G, A. Vijayaraj, Sathiya Priya S, Enhanced routing strategy of wireless sensor network based on fifth generation communication technology , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- Deepa S, Sripriya T, Radhika M, Jeneetha J. J, Experimental evaluation of artificial intelligence assisted heart disease prediction using deep learning principle , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- K. Sreenivasulu, Sampath S, Arepalli Gopi, Deepak Kartikey, S. Bharathidasan, Neelam Labhade Kumar, Advancing device and network security for enhanced privacy , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- V. Karthikeyan, C. Jayanthi, Improving image quality assessment with enhanced denoising autoencoders and optimization methods , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- K Sreenivasulu, Sameer Yadav, G Pushpalatha, R Sethumadhavan, Anup Ingle, Romala Vijaya, Investigating environmental sustainability applications using advanced monitoring systems , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- M. A. Shanti, Optimizing predictive accuracy: A comparative study of feature selection strategies in the healthcare domain , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- Nisha Rathore, Purnendu B. Acharjee, K. Thivyabrabha, Umadevi P, Anup Ingle, Davinder kumar, Researching brain-computer interfaces for enhancing communication and control in neurological disorders , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- Pravin P. Adivarekar1, Amarnath Prabhakaran A, Sukhwinder Sharma, Divya P, Muniyandy Elangovan, Ravi Rastogi, Automated machine learning and neural architecture optimization , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
<< < 35 36 37 38 39 40 41 > >>
You may also start an advanced similarity search for this article.

