Comparative study on job scheduling using priority rule and machine learning
Cloud computing is a potential technique for running resource-intensive applications on a wide scale. Implementation of a suitable scheduling algorithm is critical in order to properly use cloud resources. Shortest Job First (SJF) and Longest Job First (LJF) are two well-known corporate schedulers t...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
IEEE
2021
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/34580/1/Comparative%20study%20on%20job%20scheduling%20using%20priority%20rule%20and%20machine%20learning.pdf http://umpir.ump.edu.my/id/eprint/34580/2/Comparative%20study%20on%20job%20scheduling%20using%20priority%20rule%20and%20machine%20learning_FULL.pdf |
| _version_ | 1825824058885799936 |
|---|---|
| author | Murad, Saydul Akbar Zafril Rizal, M Azmi Abu Jafar, Md Muzahid Al-Imran, Md. |
| author_facet | Murad, Saydul Akbar Zafril Rizal, M Azmi Abu Jafar, Md Muzahid Al-Imran, Md. |
| author_sort | Murad, Saydul Akbar |
| collection | UMP |
| description | Cloud computing is a potential technique for running resource-intensive applications on a wide scale. Implementation of a suitable scheduling algorithm is critical in order to properly use cloud resources. Shortest Job First (SJF) and Longest Job First (LJF) are two well-known corporate schedulers that are now used to manage Cloud tasks. Although such algorithms are basic and straightforward to develop, they are limited in their ability to deal with the dynamic nature of the Cloud. In our research, we have demonstrated a comparison in our investigations between the priority algorithm performance matrices and the machine learning algorithm. In cloudsim and Google Colab, we finished our experiment. CPU time, turnaround time, wall clock time, waiting time, and execution start time are all included in this research. For time and space sharing mode, the cloudlet is assigned to the CPU. VM is allocated in space-sharing mode all the time. We’ve achieved better for SJF and a decent machine learning algorithm outcome as well. |
| first_indexed | 2024-03-06T12:58:28Z |
| format | Conference or Workshop Item |
| id | UMPir34580 |
| institution | Universiti Malaysia Pahang |
| language | English English |
| last_indexed | 2024-03-06T12:58:28Z |
| publishDate | 2021 |
| publisher | IEEE |
| record_format | dspace |
| spelling | UMPir345802022-07-04T02:18:59Z http://umpir.ump.edu.my/id/eprint/34580/ Comparative study on job scheduling using priority rule and machine learning Murad, Saydul Akbar Zafril Rizal, M Azmi Abu Jafar, Md Muzahid Al-Imran, Md. QA76 Computer software Cloud computing is a potential technique for running resource-intensive applications on a wide scale. Implementation of a suitable scheduling algorithm is critical in order to properly use cloud resources. Shortest Job First (SJF) and Longest Job First (LJF) are two well-known corporate schedulers that are now used to manage Cloud tasks. Although such algorithms are basic and straightforward to develop, they are limited in their ability to deal with the dynamic nature of the Cloud. In our research, we have demonstrated a comparison in our investigations between the priority algorithm performance matrices and the machine learning algorithm. In cloudsim and Google Colab, we finished our experiment. CPU time, turnaround time, wall clock time, waiting time, and execution start time are all included in this research. For time and space sharing mode, the cloudlet is assigned to the CPU. VM is allocated in space-sharing mode all the time. We’ve achieved better for SJF and a decent machine learning algorithm outcome as well. IEEE 2021 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/34580/1/Comparative%20study%20on%20job%20scheduling%20using%20priority%20rule%20and%20machine%20learning.pdf pdf en http://umpir.ump.edu.my/id/eprint/34580/2/Comparative%20study%20on%20job%20scheduling%20using%20priority%20rule%20and%20machine%20learning_FULL.pdf Murad, Saydul Akbar and Zafril Rizal, M Azmi and Abu Jafar, Md Muzahid and Al-Imran, Md. (2021) Comparative study on job scheduling using priority rule and machine learning. In: 2021 2021 Emerging Technology in Computing, Communication and Electronics, ETCCE 2021 , 21-23 December 2021 , Dhaka, Bangladesh. pp. 1-8.. ISBN 978-166548364-3 (Published) https://doi.org/10.1109/ETCCE54784.2021.9689812 |
| spellingShingle | QA76 Computer software Murad, Saydul Akbar Zafril Rizal, M Azmi Abu Jafar, Md Muzahid Al-Imran, Md. Comparative study on job scheduling using priority rule and machine learning |
| title | Comparative study on job scheduling using priority rule and machine learning |
| title_full | Comparative study on job scheduling using priority rule and machine learning |
| title_fullStr | Comparative study on job scheduling using priority rule and machine learning |
| title_full_unstemmed | Comparative study on job scheduling using priority rule and machine learning |
| title_short | Comparative study on job scheduling using priority rule and machine learning |
| title_sort | comparative study on job scheduling using priority rule and machine learning |
| topic | QA76 Computer software |
| url | http://umpir.ump.edu.my/id/eprint/34580/1/Comparative%20study%20on%20job%20scheduling%20using%20priority%20rule%20and%20machine%20learning.pdf http://umpir.ump.edu.my/id/eprint/34580/2/Comparative%20study%20on%20job%20scheduling%20using%20priority%20rule%20and%20machine%20learning_FULL.pdf |
| work_keys_str_mv | AT muradsaydulakbar comparativestudyonjobschedulingusingpriorityruleandmachinelearning AT zafrilrizalmazmi comparativestudyonjobschedulingusingpriorityruleandmachinelearning AT abujafarmdmuzahid comparativestudyonjobschedulingusingpriorityruleandmachinelearning AT alimranmd comparativestudyonjobschedulingusingpriorityruleandmachinelearning |