Cloud Computing has become a popular computing paradigm which has gained enormous attention in delivering on-demand services. Task scheduling in cloud computing is an important issue that has been well researched and many algorithms have been developed for the same. However, the goal of most of these algorithms is to minimize the overall completion time (i.e., makespan) without looking into minimization of the overall cost of the service (referred as budget). Moreover, many of them are applicable to single-cloud environment. In this paper, we propose a multi-objective task scheduling algorithm for heterogeneous multi-cloud environment which takes care both these issues. We perform rigorous experiments on some synthetic and benchmark data sets. The experimental results show that the proposed algorithm balances both the makespan and total cost in contrast to two existing task scheduling algorithms in terms of various performance metrics including makespan, total cost and average cloud utilization.

Recommendation System (RS) has been broadly utilized in various areas and discovers product recommendations during an active user interaction in the E-Commerce sites. Tremendous growth of users and products in recent years has faced some key challenges. There are numerous online sites that present many decisions to the user at once, which is strenuous. Moreover, finding the active user or right product is an important task in RS. Existing works have been proposed to recommend a product by considering user inclination and socio-demographic behaviour. In this paper, we propose a Hybrid Action-Related K-Nearest Neighbour similarity (HAR-KNN) recommender that consolidates the simplicity of hybrid filtering to enrich user behaviour matrix with formation of the vector of features. It will classify the features using race classifiers from both quality and quantity aspects. The proposed approach also addresses the problems of the previous methods to efficiently evaluate user preference on products and balance feature analysis. The K-NN classification method has been qualified online and real-time to find user behaviour data coordinating to a specific user group containing the relationship between the similarity of many users and target users from a huge amount of data. The proposed experimental result is evaluated based on measures such as Mean Absolute Error (MAE), Mean Square Error (MSE) and Root Mean Squared Error (RMSE) with the lowest error of 0.7165, 0.7201 and 0.7322 separately. High predictive measures like Precision (P), Recall (R) and F1 are found to have values 0.8501, 0.2201 and 0.3507 respectively.