{"title":"Improved Round Robin Scheduling Algorithm With Varying Time Quantum","authors":"F. Alaa, M. Zoulikha, Bendoukha Hayat","doi":"10.1109/EDiS49545.2020.9296452","DOIUrl":null,"url":null,"abstract":"Cloud computing is a distributed computing model; which refers to manipulating, configuring, and accessing the applications online. It offers online data storage, infrastructure and application. Task scheduling is one of the most important issues in cloud environment, such as the tasks must be affected to the appropriate virtual machines considering different factors at the same time, which leads to considering the task scheduling problem an NP-complete problem. This article presents an improved ROUND ROBIN (RR) CPU scheduling algorithm with varying time quantum. The appropriate algorithm proven better than traditional RR and IRRVQ algorithms. The results show that the waiting time and turnaround time have been reduced in the proposed approach compared to traditional RR and IRRVQ","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDiS49545.2020.9296452","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Cloud computing is a distributed computing model; which refers to manipulating, configuring, and accessing the applications online. It offers online data storage, infrastructure and application. Task scheduling is one of the most important issues in cloud environment, such as the tasks must be affected to the appropriate virtual machines considering different factors at the same time, which leads to considering the task scheduling problem an NP-complete problem. This article presents an improved ROUND ROBIN (RR) CPU scheduling algorithm with varying time quantum. The appropriate algorithm proven better than traditional RR and IRRVQ algorithms. The results show that the waiting time and turnaround time have been reduced in the proposed approach compared to traditional RR and IRRVQ