A dynamic cluster job scheduling optimisation algorithm based on data irreversibility in sensor cloud Online publication date: Tue, 24-Sep-2019
by Zeyu Sun; Jun Liu; Xiaofei Xing; Chuanfeng Li; Xiaoyan Pan
International Journal of Embedded Systems (IJES), Vol. 11, No. 5, 2019
Abstract: The optimisation algorithm based on irreversible data for the job scheduling of dynamic cluster is crucial to the improvement of the cluster rendering throughput and the cluster rendering efficiency. However, the dispatching imbalance of the cluster rendering task on the massive number of cluster rendering nodes will prolong the waiting time for the completion of job. Therefore, we propose dynamic cluster job scheduling optimisation algorithm based on data irreversibility (DCJS_DI). Firstly, we analyse the job scheduling target. Then, we exploit the frame independence with the clustering rendering and further establish the job scheduling model for the irreversible data dynamic cluster. Next, we elaborate on the job scheduling process of the irreversible data dynamic cluster and the dispatching process of the cluster rendering task. Finally, we investigate via simulation results the impacts of the job hunger and the resource fragmentation issue of the traditional job scheduling strategies on the system performance, the impacts of the multi-progress and multi-threading cluster rendering on the job completion time and the resource efficiency of the irreversible data dynamic cluster. We further study the extension of the cluster computation capability and the reliability issue of the cloud service.
Online publication date: Tue, 24-Sep-2019
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org