期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2018
卷号：96
期号：13
出版社：Journal of Theoretical and Applied
摘要：Compute resources scheduling is an essential aspect of any computing paradigm and it becomes a decisive feature for cloud computing model given the new service delivery model proposed by this innovative computing technology. To the extent of our knowledge, one of the most used scheduling algorithms, up to this moment, is Round Robin scheduling considering its time-shared design, which assigns a time slice (time quantum) to each task or job scheduled for execution on the Core Processing Unit (CPU). Mostly, all computer platforms using Round Robin scheduling, comprised the ones used on Cloud Computing environments, adopts a fixed value for time quantum that usually causes processor thrashing. In this paper, a new compute resources scheduling algorithm is proposed, in which it uses the Round Robin time-shared design with a dynamic time quantum extracted from scheduled tasks characteristics. Moreover, Artificial Neural Networks capabilities of prediction and classification are used in order to automatically select the finest time quantum calculation method that would optimize the average waiting and turnaround time of the compute resources scheduler intended for cloud computing environments. Additionally, a comparison of the proposed algorithm with the First Come First Served and the simple Round Robin algorithms is discussed in order to highlight the significance of our proposed method.
关键词：Cloud Computing; Task Scheduling; Neural Networks; Multilayer Perceptron; Round Robin
