Optimized online scheduling algorithms
MetadataShow full item record
© Springer International Publishing AG 2018. 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.
Showing items related by title, author, creator and subject.
Kulanoot, Araya (2000)The Knapsack Problems are among the simplest integer programs which are NP-hard. Problems in this class are typically concerned with selecting from a set of given items, each with a specified weight and value, a subset ...
Huo, Jia Q. (1999)Adaptive filters have found applications in many signal processing problems. In some situations, linear constraints are imposed on the filter weights such that the filter is forced to exhibit a certain desired response. ...
Techniques for improving clustering and association rules mining from very large transactional databasesLi, Yanrong (2009)Clustering and association rules mining are two core data mining tasks that have been actively studied by data mining community for nearly two decades. Though many clustering and association rules mining algorithms have ...