Hierarchy Value Density - A Priority Algorithm for Task Scheduling on Cloud

To address the Task scheduling problem in cloud platform, a new hierarchy value density algorithm based on the value density algorithm of the real-time task scheduling system is presented in this study by further studying the cloud technology and the real-time system. The new algorithm improves the value density algorithm and maintains the ability of the value density algorithm to describe the value and time. The new algorithm expands the value attribute of the task into the relative value and the value hierarchy. Besides, the new algorithm also adds a f adjustment factor, which adjusts the weight of the time attribute in the algorithm to achieve the aim of adjusting the algorithm in line with the actual situation. With these features of the algorithm, it can gain an advantage to dynamically and specifically distinguish different tasks for large quantities, multiple values as well as higher time requirements. Thus, it is possible to achieve the effect of distinguishing and scheduling tasks more efficiently. In the experiment part, the algorithm is compared with traditional algorithm in this study to observe and show its characters and advantages through a distributed server simulation model accordance with the M/M/C model of queuing theory.