As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Data intensive batch processing scientific workflow is a typical application model in the era of big data. A reasonable scheduling method can improve the resource utilization rate and reduce the rental cost on the premise of meeting the deadline requirements. In this paper, an iterative floating interval allocation method suitable for batch scientific workflow is proposed in the deadline allocation stage, and then in the resource mapping stage, a task scheduling algorithm considering the utilization of time gaps and minimizing the cost of renting virtual machines is proposed, which weighted the expected utilization of time slices. Experiments show that compared with similar scheduling algorithms, in the specified deadline time, it can not only better solve the data transmission bottleneck, but also better improve the execution efficiency and reduce the total rental cost.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.