Lipsa, SwatiDash, Ranjan KumarIvkovic, NikolaCengiz, Korhan2024-05-202024-05-2020232169-3536https://doi.org10.1109/ACCESS.2023.3255781https://hdl.handle.net/20.500.12713/4584In this paper, a task scheduling problem for a cloud computing environment is formulated by using the M/M/n queuing model. A priority assignment algorithm is designed to employ a new data structure named the waiting time matrix to assign priority to individual tasks upon arrival. In addition to this, the waiting queue implements a unique concept based on the principle of the Fibonacci heap for extracting the task with the highest priority. This work introduces a parallel algorithm for task scheduling in which the priority assignment to task and building of heap is executed in parallel with respect to the non-preemptive and preemptive nature of tasks. The proposed work is illustrated in a step-by-step manner with an appropriate number of tasks. The performance of the proposed model is compared in terms of overall waiting time and CPU time against some existing techniques like BATS, IDEA, and BATS+BAR to determine the efficacy of our proposed algorithms. Additionally, three distinct scenarios have been considered to demonstrate the competency of the task scheduling method in handling tasks with different priorities. Furthermore, the task scheduling algorithm is also applied in a dynamic cloud computing environment.eninfo:eu-repo/semantics/openAccessFibonacci HeapCloud ComputingPreemptive SchedulingPriority QueueTask SchedulingVirtual MachineArticle112711127126WOS:0009588528000012-s2.0-85149831996N/A10.1109/ACCESS.2023.3255781Q1