Abstract
However, all algorithms mentioned in Chap. 2 are considered as concurrent processing but not parallel processing and all are suitable to handle non-data intensive applications in cloud environment as all are considered as complex algorithm which consumes relatively high amount of memory, bandwidth and computational power to maintain its data structure. The outcome of maintaining these data structures will cause the time of scheduling tasks unbounded and make loss in profit gains. Undeniably, profit gain by IaaS provider is inversely proportional to time consumed to finish a task. To encounter most of the aspects and issues which are mentioned in Chap. 3, this project propose an online scheduling algorithm is to overcome the various excessive overheads during process while maintaining service performance and comparable least time consuming approach for data intensive task to adapt in the future cloud system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Tan, R., Leong, J.A., Sidhu, A.S. (2018). Optimized Online Scheduling Algorithms. In: Optimized Cloud Based Scheduling. Studies in Computational Intelligence(), vol 759. Springer, Cham. https://doi.org/10.1007/978-3-319-73214-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-73214-5_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73212-1
Online ISBN: 978-3-319-73214-5
eBook Packages: EngineeringEngineering (R0)