A New Hybrid TLPD Algorithm for Task Scheduling in Cloud Computing
| العنوان: | A New Hybrid TLPD Algorithm for Task Scheduling in Cloud Computing |
|---|---|
| المؤلفون: | null Vijay Mohan Shrimal, null Prof. (Dr.) Y. C. Bhatt, null Prof. (Dr.) Y. S. Shishodia |
| المصدر: | International Journal of Scientific Research in Science, Engineering and Technology. :460-467 |
| بيانات النشر: | Technoscience Academy, 2022. |
| سنة النشر: | 2022 |
| مصطلحات موضوعية: | General Computer Science |
| الوصف: | In this paper we have designed the hybrid approach of combination of credit based task length & priority algorithm and credit based deadline algorithm as well as compare the results with FCFS, SJF and task length & priority scheduling algorithms. When we use the credit based task length & priority scheduling algorithm to schedule the task without knowing the deadline of the task, it will cause the dead of the least deadline task. The deadline credit is also included so that assigning number of resources to the tasks in such a way that there will be maximum resource utilization and minimum processing time achieved. This paper presents the simulation results of the proposed methodology implemented with the help of Cloudsim and Net beansIDE8.0 and analysis of results. |
| تدمد: | 2394-4099 2395-1990 |
| DOI: | 10.32628/ijsrset229459 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::b923c0e453c68f962555c49316e11f4e https://doi.org/10.32628/ijsrset229459 |
| رقم الانضمام: | edsair.doi...........b923c0e453c68f962555c49316e11f4e |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 23944099 23951990 |
|---|---|
| DOI: | 10.32628/ijsrset229459 |