Nonlinear Analysis of EDF Scheduling Framework for Resource Distribution in Cloud Computing

In modern times, the field of information technology is significantly shifting towards cloud computing. This innovative technology involves the permanent storage of resources on servers, which clients access via the internet. Typically, a cloud comprises a collection of resources known as virtual machines, capable of managing both computational tasks and storage needs. As the demand for cloud services continues to rise, the scheduling of these resources presents a considerable challenge. Scheduling refers to the workflow management necessary to complete tasks within the system. An efficient scheduler adapts its scheduling policy dynamically in response to changing conditions and task requirements. Cloud computing represents a recently developed technology where resources, whether physical or virtual machines, are permanently stored on servers and accessed by users through the internet. The cloud offers various service models, including Platform as a Service (PaaS), Software as a Service (SaaS), and Infrastructure as a Service (IaaS). In this context, IaaS refers to a set of resources, including virtual machines, that provide computational and storage services. Given the increasing adoption of cloud technology, resource scheduling has become a critical task. Hence, optimizing the scheduling of requests to ensure the best utilization of cloud resources is essential. This paper introduces a Nonlinear Analysis of EDF Scheduling Framework for resource allocation that considers deadlines and processing times when assigning resources to specific jobs. The performance metrics, including Average Turnaround Time, Average Waiting Time, and Average Deadline Violation, show a significant improvement when compared to traditional scheduling models such as First-Come, First-Served (FCFS), the Shortest Job First (SJF), and Simple Earliest Deadline First (EDF) models.

Authors

Publication Details

Journal
Communications on Applied Nonlinear Analysis
Published
2024-09-16
DOI
https://doi.org/10.52783/cana.v32.1658
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Nonlinear Analysis of EDF Scheduling Framework for Resource Distribution in Cloud Computing

Neelima Priyanka Nutulapati
Communications on Applied Nonlinear Analysis
Cloud Computing and Resource Management
article

Nonlinear Analysis of EDF Scheduling Framework for Resource Distribution in Cloud Computing

Neelima Priyanka Nutulapati
article en

Abstract

In modern times, the field of information technology is significantly shifting towards cloud computing. This innovative technology involves the permanent storage of resources on servers, which clients access via the internet. Typically, a cloud comprises a collection of resources known as virtual machines, capable of managing both computational tasks and storage needs. As the demand for cloud services continues to rise, the scheduling of these resources presents a considerable challenge. Scheduling refers to the workflow management necessary to complete tasks within the system. An efficient scheduler adapts its scheduling policy dynamically in response to changing conditions and task requirements. Cloud computing represents a recently developed technology where resources, whether physical or virtual machines, are permanently stored on servers and accessed by users through the internet. The cloud offers various service models, including Platform as a Service (PaaS), Software as a Service (SaaS), and Infrastructure as a Service (IaaS). In this context, IaaS refers to a set of resources, including virtual machines, that provide computational and storage services. Given the increasing adoption of cloud technology, resource scheduling has become a critical task. Hence, optimizing the scheduling of requests to ensure the best utilization of cloud resources is essential. This paper introduces a Nonlinear Analysis of EDF Scheduling Framework for resource allocation that considers deadlines and processing times when assigning resources to specific jobs. The performance metrics, including Average Turnaround Time, Average Waiting Time, and Average Deadline Violation, show a significant improvement when compared to traditional scheduling models such as First-Come, First-Served (FCFS), the Shortest Job First (SJF), and Simple Earliest Deadline First (EDF) models.

Communications on Applied Nonlinear AnalysisVol. 32(1)
Openalex Percentile: Top 75%
Cloud Computing and Resource Management
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.