Quantum time task scheduling technique in novel hybrid shortest job first and round robin
In a cloud computing environment, there are huge number of tasks with different computing requirements need to be scheduled and provisioned to the various resources within different capabilities. Thus, the mapping between users and resources is crucial so that the performance could be improved. The...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Science Publishing Corporation
2018
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/73698/ http://psasir.upm.edu.my/id/eprint/73698/1/Quantum%20time%20task%20scheduling%20technique%20in%20novel%20hybrid%20shortest%20job%20first%20and%20round%20robin.pdf |
| _version_ | 1848857339806875648 |
|---|---|
| author | Derahman, Mohd Noor Roslan, Ahmad Shakir Huyop @ Ayop, Fahrul Hakim |
| author_facet | Derahman, Mohd Noor Roslan, Ahmad Shakir Huyop @ Ayop, Fahrul Hakim |
| author_sort | Derahman, Mohd Noor |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | In a cloud computing environment, there are huge number of tasks with different computing requirements need to be scheduled and provisioned to the various resources within different capabilities. Thus, the mapping between users and resources is crucial so that the performance could be improved. The hybrid algorithm Shortest-Job-First (SJF) and Round Robin (RR) are expected to address all the concerns in scheduling task namely response time, waiting time and turnaround time simultaneously. Existing schedulers has been focused on those parameters but starvation problems are mostly not their major concern. Therefore, this study attempts to produce a better performance of hybrid algorithm through the integration of two traditional algorithms namely SJF and RR with dynamic quantum (SRDQ). Our proposed SRDQ with the best quantum time approach apparently reduces the longer waiting time when involves with a large cloudlet. Thus, it is suitable for the cloud computing environments where the resource hunger applications are normally provisioned. |
| first_indexed | 2025-11-15T11:55:59Z |
| format | Article |
| id | upm-73698 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T11:55:59Z |
| publishDate | 2018 |
| publisher | Science Publishing Corporation |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-736982020-05-09T20:58:23Z http://psasir.upm.edu.my/id/eprint/73698/ Quantum time task scheduling technique in novel hybrid shortest job first and round robin Derahman, Mohd Noor Roslan, Ahmad Shakir Huyop @ Ayop, Fahrul Hakim In a cloud computing environment, there are huge number of tasks with different computing requirements need to be scheduled and provisioned to the various resources within different capabilities. Thus, the mapping between users and resources is crucial so that the performance could be improved. The hybrid algorithm Shortest-Job-First (SJF) and Round Robin (RR) are expected to address all the concerns in scheduling task namely response time, waiting time and turnaround time simultaneously. Existing schedulers has been focused on those parameters but starvation problems are mostly not their major concern. Therefore, this study attempts to produce a better performance of hybrid algorithm through the integration of two traditional algorithms namely SJF and RR with dynamic quantum (SRDQ). Our proposed SRDQ with the best quantum time approach apparently reduces the longer waiting time when involves with a large cloudlet. Thus, it is suitable for the cloud computing environments where the resource hunger applications are normally provisioned. Science Publishing Corporation 2018 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/73698/1/Quantum%20time%20task%20scheduling%20technique%20in%20novel%20hybrid%20shortest%20job%20first%20and%20round%20robin.pdf Derahman, Mohd Noor and Roslan, Ahmad Shakir and Huyop @ Ayop, Fahrul Hakim (2018) Quantum time task scheduling technique in novel hybrid shortest job first and round robin. International Journal of Engineering and Technology (UAE), 7 (4). 3097 - 3102. ISSN 2227-524X 10.14419/ijet.v7i4.1756 |
| spellingShingle | Derahman, Mohd Noor Roslan, Ahmad Shakir Huyop @ Ayop, Fahrul Hakim Quantum time task scheduling technique in novel hybrid shortest job first and round robin |
| title | Quantum time task scheduling technique in novel hybrid shortest job first and round robin |
| title_full | Quantum time task scheduling technique in novel hybrid shortest job first and round robin |
| title_fullStr | Quantum time task scheduling technique in novel hybrid shortest job first and round robin |
| title_full_unstemmed | Quantum time task scheduling technique in novel hybrid shortest job first and round robin |
| title_short | Quantum time task scheduling technique in novel hybrid shortest job first and round robin |
| title_sort | quantum time task scheduling technique in novel hybrid shortest job first and round robin |
| url | http://psasir.upm.edu.my/id/eprint/73698/ http://psasir.upm.edu.my/id/eprint/73698/ http://psasir.upm.edu.my/id/eprint/73698/1/Quantum%20time%20task%20scheduling%20technique%20in%20novel%20hybrid%20shortest%20job%20first%20and%20round%20robin.pdf |