Task Scheduling in Cloud Computing: A Priority-Based Heuristic Approach

Basit Öğe Kaydı
dc.authoridDash, Ranjan Kumar/0000-0003-3482-465X
dc.authoridIvkovic, Nikola/0000-0003-1730-2518
dc.authoridCengiz, Korhan/0000-0001-6594-8861
dc.authorwosidDash, Ranjan Kumar/ABA-8593-2020
dc.contributor.authorLipsa, Swati
dc.contributor.authorDash, Ranjan Kumar
dc.contributor.authorIvkovic, Nikola
dc.contributor.authorCengiz, Korhan
dc.date.accessioned2024-05-20T14:38:44Z
dc.date.available2024-05-20T14:38:44Z
dc.date.issued2023
dc.departmentİstinye Üniversitesien_US
dc.description.abstractIn 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.en_US
dc.identifier.doi10.1109/ACCESS.2023.3255781
dc.identifier.endpage27126en_US
dc.identifier.issn2169-3536
dc.identifier.scopus2-s2.0-85149831996en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage27111en_US
dc.identifier.urihttps://doi.org10.1109/ACCESS.2023.3255781
dc.identifier.urihttps://hdl.handle.net/20.500.12713/4584
dc.identifier.volume11en_US
dc.identifier.wosWOS:000958852800001en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIeee-Inst Electrical Electronics Engineers Incen_US
dc.relation.ispartofIeee Accessen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.snmz20240519_kaen_US
dc.subjectFibonacci Heapen_US
dc.subjectCloud Computingen_US
dc.subjectPreemptive Schedulingen_US
dc.subjectPriority Queueen_US
dc.subjectTask Schedulingen_US
dc.subjectVirtual Machineen_US
dc.titleTask Scheduling in Cloud Computing: A Priority-Based Heuristic Approachen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu