{"title":"基于随机神经网络的云中任务完成时间最小化","authors":"Yu Wang, Wu Tongtong","doi":"10.1109/CBFD52659.2021.00019","DOIUrl":null,"url":null,"abstract":"With the development of IoT and 5G, the number of devices accessing the Internet is increasing every day. While mobile edge computing effectively reduces the pressure on cloud centers, cloud centers still face the challenge of task scheduling and resource allocation for a large amount of SaaS applications. In this paper, the conditions for minimizing the average task completion time are derived by a simplified queuing model and an adaptive dynamic scheduling algorithm for minimizing the average task completion time is proposed in combination with stochastic neural networks, which is based on online measurements and takes up very little resources and computation. A diverse range of algorithms are tested in many different environments as a way to analyze algorithm performance. The simulation results show that our proposed algorithm is effective in reducing the average task completion time in a variety of environments.","PeriodicalId":230625,"journal":{"name":"2021 International Conference on Computer, Blockchain and Financial Development (CBFD)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimizing Task Completion Time in the Cloud based on Random Neural Network\",\"authors\":\"Yu Wang, Wu Tongtong\",\"doi\":\"10.1109/CBFD52659.2021.00019\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the development of IoT and 5G, the number of devices accessing the Internet is increasing every day. While mobile edge computing effectively reduces the pressure on cloud centers, cloud centers still face the challenge of task scheduling and resource allocation for a large amount of SaaS applications. In this paper, the conditions for minimizing the average task completion time are derived by a simplified queuing model and an adaptive dynamic scheduling algorithm for minimizing the average task completion time is proposed in combination with stochastic neural networks, which is based on online measurements and takes up very little resources and computation. A diverse range of algorithms are tested in many different environments as a way to analyze algorithm performance. The simulation results show that our proposed algorithm is effective in reducing the average task completion time in a variety of environments.\",\"PeriodicalId\":230625,\"journal\":{\"name\":\"2021 International Conference on Computer, Blockchain and Financial Development (CBFD)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Computer, Blockchain and Financial Development (CBFD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CBFD52659.2021.00019\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Computer, Blockchain and Financial Development (CBFD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CBFD52659.2021.00019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Minimizing Task Completion Time in the Cloud based on Random Neural Network
With the development of IoT and 5G, the number of devices accessing the Internet is increasing every day. While mobile edge computing effectively reduces the pressure on cloud centers, cloud centers still face the challenge of task scheduling and resource allocation for a large amount of SaaS applications. In this paper, the conditions for minimizing the average task completion time are derived by a simplified queuing model and an adaptive dynamic scheduling algorithm for minimizing the average task completion time is proposed in combination with stochastic neural networks, which is based on online measurements and takes up very little resources and computation. A diverse range of algorithms are tested in many different environments as a way to analyze algorithm performance. The simulation results show that our proposed algorithm is effective in reducing the average task completion time in a variety of environments.