Adapting market-oriented policies for scheduling divisible loads on clouds

Abstract

Cloud computing has become an important alternative for solving big data processing. Nowadays, cloud service providers usually offer users a virtual machine with various combinations of prices. As each user has different circumstances, the problem of choosing the cost-minimized combination under a deadline constraint as well as user's preference is becoming more complex. This article is concerned with the investigation of adapting a user's preference policies for scheduling real-time divisible loads in a cloud computing environment. The workload allocation approach used in this research is using Divisible Load Theory. The proposed algorithm aggregates resources into groups and optimally distributes the fractions of load to the available resources according to user's preference. The proposed algorithm was evaluated by simulation experiments and compared with the baseline approach. The result obtained from the proposed algorithm reveals that a significant reduction in computation cost can be attained when the user's preferences are low priority.