{"title":"Optimization of Resource Scheduling and Allocation Algorithms","authors":"S. Rahul, Vinay Bhardwaj","doi":"10.1109/icps55917.2022.00034","DOIUrl":null,"url":null,"abstract":"The expeditious growth of the Internet of Things (IoT), ubiquitous, networked computer gadgets will pervade commercial and private areas. Devices are accessed through the Internet, and resources are kept in the cloud. Because IoT devices are power-constrained, they cannot connect to the internet or the cloud directly. Fog Computing is used to link IoT devices to the Internet or the Cloud. Fog computing is a cloud computing extension in which processing is performed on edge devices or adjacent localized data centers or cloudlets. The most crucial factors influencing fog computing performance is resource management. Due to resource constraints, resource planning is a major concern in the IoT-Cloud-Fog system. Numerous studies have introduced optimization techniques like max min , FCFS, Round robin, min min, GA. As a result of this, the IoT-Fog-Cloud System saves time, money, and energy. The goal of resource scheduling is to choose the optimal resource from a variety of matching resources which are physically available. Following scheduling, resource allocation is carried out, with the goal of allocating the chosen resource to the job. In a Cloud context, resource allocation refers to the process of assigning available virtual machine instances to workloads. This paper discusses and analyzes Min-Min, Round robin, FCFS, SJF suitable for secluding considering the following parameters average waiting time , average response time and makespan. Finally, we propose a hybrid algorithm and compare the recommended algorithm with the existing algorithm in terms of effectiveness","PeriodicalId":263404,"journal":{"name":"2022 Second International Conference on Interdisciplinary Cyber Physical Systems (ICPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Second International Conference on Interdisciplinary Cyber Physical Systems (ICPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icps55917.2022.00034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The expeditious growth of the Internet of Things (IoT), ubiquitous, networked computer gadgets will pervade commercial and private areas. Devices are accessed through the Internet, and resources are kept in the cloud. Because IoT devices are power-constrained, they cannot connect to the internet or the cloud directly. Fog Computing is used to link IoT devices to the Internet or the Cloud. Fog computing is a cloud computing extension in which processing is performed on edge devices or adjacent localized data centers or cloudlets. The most crucial factors influencing fog computing performance is resource management. Due to resource constraints, resource planning is a major concern in the IoT-Cloud-Fog system. Numerous studies have introduced optimization techniques like max min , FCFS, Round robin, min min, GA. As a result of this, the IoT-Fog-Cloud System saves time, money, and energy. The goal of resource scheduling is to choose the optimal resource from a variety of matching resources which are physically available. Following scheduling, resource allocation is carried out, with the goal of allocating the chosen resource to the job. In a Cloud context, resource allocation refers to the process of assigning available virtual machine instances to workloads. This paper discusses and analyzes Min-Min, Round robin, FCFS, SJF suitable for secluding considering the following parameters average waiting time , average response time and makespan. Finally, we propose a hybrid algorithm and compare the recommended algorithm with the existing algorithm in terms of effectiveness