Fast-FFA: a fast online scheduling approach for big data stream computing with future features-aware Online publication date: Thu, 21-Sep-2017
by Dawei Sun; Hao Tang
International Journal of Bio-Inspired Computation (IJBIC), Vol. 10, No. 3, 2017
Abstract: Awareness of future features is more important than that of historical features for online scheduling in a big data stream computing environment. In this paper, a fast future feature-aware online scheduling approach fast-FFA is put forward, exhibiting the following contributions; 1) Modelling the online resource scheduling from viewpoints of user and data centre, considering multi-dimensional features of online data stream and quantitating preferences and utilities of each dimension. 2) Obtaining future features from historical features of multidimensional data stream with a hybrid particle swarm optimisation, back propagation (PSO-BP) algorithm and optimising online scheduling with an immune clonal algorithm. 3) Evaluating fast-FFA and balancing both fast future feature awareness and acceptable accuracy objectives. Experimental results demonstrate that the proposed fast-FFA approach has high potential as the approach provides significant system efficiency enhancements in online big data environments.
Existing subscribers:
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 Bio-Inspired Computation (IJBIC):
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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook