IDEAS home Printed from https://ideas.repec.org/a/gvu/iroism/v5y2023i4id1003.html

Performance Analysis of Various Scheduling Algorithms using CloudSim

Author

Listed:
  • Pratima Chapagai
  • Subarna Shakya

Abstract

Cloud computing technologies have quickly changed how companies and organizations manage their IT resources. The core of this transformation has evolved as cloud datacenters, which offer scalable and affordable options for hosting and administering a variety of applications and services. One information technology typology that has been widely employed to deliver a range of services via the Internet is cloud computing. It guarantees simpler access to premium services and resources. Cloud systems' operation needs to be planned in order to effectively deliver services to individuals. Task scheduling seeks to maximize system throughput and distribute diverse computational resources to software programs. The unpredictability of the scenario grows as the task and has a strong potential for successful resolution. The study begins with an experimental setup to analyse the various performance metrics of task scheduling algorithms. Every experiment has several important stages. To replicate scenarios found in the real world where jobs are divided across many computing resources, the tasks are assigned to available data centers. A number of experiments were carried out to analyse the performance of First Come First Service (FCFS), Shortest Job First (SJF), Round Robin (RR) and Particle Swarm Optimization (PSO) scheduling algorithms using the parameters: makespan, average completion time, average waiting time, and average cost consumption. Thus, this study provides a description of task scheduling and the performance analysis of algorithms to task scheduling that is employed in cloud computing environments.

Suggested Citation

Handle: RePEc:gvu:iroism:v:5:y:2023:i:4:id:1003
DOI: 10.36548/jismac.2023.4.001
as

Download full text from publisher

File URL: https://irojournals.com/iroismac/article/view/1003
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/iroismac/article/download/1003/891
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jismac.2023.4.001?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;
;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gvu:iroism:v:5:y:2023:i:4:id:1003. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Manager (email available below). General contact details of provider: https://irojournals.com/iroismac .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.