Performance evaluation of task scheduling algorithms in virtual cloud environment to minimize makespan

Cloud computing has emerged as a foremost technology utilizing the notion of commercial application of technology with public users. Cloud computing is recognized because of its ability to dynamically allocate resources on-demand offering pronounced scalability, performance, minimal maintenance, and...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of information technology (Singapore. Online) Ročník 14; číslo 1; s. 79 - 93
Hlavní autoři: Kaur, Rajbhupinder, Laxmi, Vijay, Balkrishan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Singapore Springer Singapore 01.02.2022
Springer Nature B.V
Témata:
ISSN:2511-2104, 2511-2112
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Cloud computing has emerged as a foremost technology utilizing the notion of commercial application of technology with public users. Cloud computing is recognized because of its ability to dynamically allocate resources on-demand offering pronounced scalability, performance, minimal maintenance, and cost-effectiveness. The resources are shared among users via the virtualization technique. High performance can be extracted from cloud computing by effectively performing task scheduling. Task scheduling is the primary concern to be considered for the dynamic allocation of resources to enhance performance and minimize the makespan. Task scheduling is considered a major factor because it directly influences the other factors monitoring performance like power consumption, best cost, scalability, and availability. The research work is conducted to calculate the makespan in cloud computing via a virtual environment on four prominent task scheduling algorithms: FCFS (first come first serve), RR (round Robin), SJF (shortest job first), and PSO (particle swarm intelligence). The VMs (virtual machines) and data centers with unique ids have been brought into practice to analyze the working of considered task scheduling algorithms. The execution time required for the successful completion of each stage has been recorded to compute the makespan. The research paper discusses the adopted process used in executing the task scheduling via an appropriate algorithm, pseudocode, and flowchart. The results have been obtained based on the working principle of four task scheduling algorithms and compared based on makespan.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2511-2104
2511-2112
DOI:10.1007/s41870-021-00753-4