Search

To realize load balancing of cloud computing platforms in big data processing, the method of finding the optimal load balancing physical host in the algorithm cycle is adopted at present. This optimal load balancing strategy that overly focuses on the current deployment problem has certain limitations. It will make the system less efficient and the user's waiting time unnecessarily prolonged. This paper proposes a task assignment method for long-term resource load balancing of cloud platforms based on artificial intelligence and big data (TABAI). The maximum posterior probability for each physical host is calculated using Bayesian theory. Euler's formula is used to calculate the similarity between the host with the largest posterior probability and other hosts as a threshold. The hosts are classified according to the threshold to determine the optimal cluster and then form the final set of candidate physical hosts. It improves the resource utilization and external service capability of the cloud platform by combining cluster analysis with Bayes' theorem to achieve global load balancing in the time dimension. The experimental results show that: TABAI has a smaller processing time than the traditional load balancing multi-task assignment method. When the time is >600 s, the standard deviation of TABAI decreases to a greater extent, and it has stronger external service capabilities. [ABSTRACT FROM AUTHOR]

An important challenge facing cloud computing is how to correctly and effectively handle and serve millions of users' requests. Efficient task scheduling in cloud computing can intuitively affect the resource configuration and operating cost of the entire system. However, task and resource scheduling in a cloud computing environment is an NP-hard problem. In this paper, we propose a three-layer scheduling model based on whale-Gaussian cloud. In the second layer of the model, a whale optimization strategy based on the Gaussian cloud model (GCWOAS2) is used for multiobjective task scheduling in a cloud computing which is to minimize the completion time of the task via effectively utilizing the virtual machine resources and to keep the load balancing of each virtual machine, reducing the operating cost of the system. In the GCWOAS2 strategy, an opposition-based learning mechanism is first used to initialize the scheduling strategy to generate the optimal scheduling scheme. Then, an adaptive mobility factor is proposed to dynamically expand the search range. The whale optimization algorithm based on the Gaussian cloud model is proposed to enhance the randomness of search. Finally, a multiobjective task scheduling algorithm based on Gaussian whale-cloud optimization (GCWOA) is presented, so that the entire scheduling strategy can not only expand the search range but also jump out of the local maximum and obtain the global optimal scheduling strategy. Experimental results show that compared with other existing metaheuristic algorithms, our strategy can not only shorten the task completion time but also balance the load of virtual machine resources, and at the same time, it also has a better performance in resource utilization. [ABSTRACT FROM AUTHOR]

A heterogeneous cloud system, for example, a Hadoop 2.6.0 platform, provides distributed but cohesive services with rich features on large-scale management, reliability, and error tolerance. As big data processing is concerned, newly built cloud clusters meet the challenges of performance optimization focusing on faster task execution and more efficient usage of computing resources. Presently proposed approaches concentrate on temporal improvement, that is, shortening MapReduce time, but seldom focus on storage occupation; however, unbalanced cloud storage strategies could exhaust those nodes with heavy MapReduce cycles and further challenge the security and stability of the entire cluster. In this paper, an adaptive method is presented aiming at spatial-temporal efficiency in a heterogeneous cloud environment. A prediction model based on an optimized Kernel-based Extreme Learning Machine algorithm is proposed for faster forecast of job execution duration and space occupation, which consequently facilitates the process of task scheduling through a multi-objective algorithm called time and space optimized NSGA-II (TS-NSGA-II). Experiment results have shown that compared with the original load-balancing scheme, our approach can save approximate 47-55 s averagely on each task execution. Simultaneously, 1.254‰ of differences on hard disk occupation were made among all scheduled reducers, which achieves 26.6 % improvement over the original scheme. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

With the pervasive use of smart mobile devices and increasing wireless networking technologies, collaborations among mobile users are becoming deeper and ubiquitous. Appropriate task collaborations among mobile users could effectively improve the network processing ability with so called 'mobile cloud' or 'cloudlet'. However, task allocations confront with the security issues. The possible collusion or re-collaborations among the mobile users would possibly merge the allocated tasks of the specific users. Moreover, considering the delivery reliability and task execution efficiency, replications are applied for enhancement, which would also lead to more sever security threat for users. We investigate how to secure the security when task collaborations are allowed for mobile users. Our security scheme is built upon the load balancing scheme, and our intuitive solution is, if the tasks could be effectively balanced among users, the security issues could be guaranteed, because averaging the task assignment could effectively raise the threshold for collusion among potential malicious users. In this work, we propose 'SAFE-CROWD': a secure task offloading and reassignment scheme among mobile users. The basic idea is simple, we leverage the 'ball and bin' theory for task assignment, where d mobile users in contact range are investigated, and we select the least loaded ones among them. It has been proved that such simple cases can effectively reduce the largest queueing length from [ABSTRACT FROM AUTHOR]

Software-as-a-service (SaaS) has emerged as a new computing paradigm to provide reliable software on demand. With such an inspiring motivation, sensor cloud system can benefit from this infrastructure. Generally, sharing database and schema is the most commonly used data storage model in the cloud. However, the data storage of tenants in the cloud is approaching schema null and evolution issues. To address these limitations, this paper proposes multitenant multiple wide tables with vertical scalability by analyzing the features of multitenant data. To solve schema null issue, extended vertical part is used to trim down the amount of schema null values. To reduce probability of schema evolution, wide table is divided into multiple clusters that we called multiple wide tables. This design reaches the balance between tenant customizing and its performance. Besides, the partition and correctness of multiple wide tables with vertical scalability are discussed in detail. The experimental results indicate that the solution of our multiple wide tables with vertical scalability is superior to single wide table, and single wide table with vertical scalability in the aspects of spatial intensity and read performance. [ABSTRACT FROM AUTHOR]

Mobile cloud computing (MCC) enables the mobile devices to offload their applications to the cloud and thus greatly enriches the types of applications on mobile devices and enhances the quality of service of the applications. Under various circumstances, researchers have put forward several MCC architectures. However, how to reduce the response latency while efficiently utilizing the idle service capacities of the mobile devices still remains a challenge. In this paper, we firstly give a definition of MCC and divide the recently proposed architectures into four categories. Secondly, we present a Hybrid Local Mobile Cloud Model (HLMCM) by extending the Cloudlet architecture. Then, after formulating the application scheduling problems in HLMCM and bringing forward the Hybrid Ant Colony algorithm based Application Scheduling (HACAS) algorithm, we finally validate the efficiency of the HACAS algorithm by simulation experiments. [ABSTRACT FROM AUTHOR]