A Hybrid Approach for Task Scheduling Based Particle Swarm and Chaotic Strategies in Cloud Computing Environment

Interest in cloud computing has grown considerably over recent years, primarily due to scalable virtualized resources. So, cloud computing has contributed to the advancement of real-time applications such as signal processing, environment surveillance and weather forecast where time and energy considerations to perform the tasks are critical. In real-time applications, missing the deadlines for the tasks will cause catastrophic consequences; thus, real-time task scheduling in cloud computing environment is an important and essential issue. Furthermore, energy-saving in cloud data center, regarding the benefits such as reduction of system operating costs and environmental protection is an important concern that is considered during recent years and is reducible with appropriate task scheduling. In this paper, we present an energy-aware task scheduling approach, namely EaRTs for real-time applications. We employ the virtualization and consolidation technique subject to minimizing the energy consumptions, improve resource utilization and meeting the deadlines of tasks. In the consolidation technique, scale up and scale down of virtualized resources could improve the performance of task execution. The proposed approach comprises four algorithms, namely Energy-aware Task Scheduling in Cloud Computing(ETC), Vertical VM Scale Up(V2S), Horizontal VM Scale up(HVS) and Physical Machine Scale Down(PSD). We present the formal model of the proposed approach using Timed Automata to prove precisely the schedulability feature and correctness of EaRTs. We show that our proposed approach is more efficient in terms of deadline hit ratio, resource utilization and energy consumption compared to other energy-aware real-time tasks scheduling algorithms.

In the last few decades, a novel branch of intelligent computation algorithms has been inspired by a swarm intelligence theory which imitates the behavior of animals. These algorithms are successfully applied to solve many kinds of simple and complex problems in several fields such as optimization problems, pattern recognition, image processing, features section, and task scheduling in cloud and parallel computing. Cloud computing has not only become the preferred environment for several companies, but also helps others to overcome many server-related issues by utilizing characteristics such as reliability, flexibility, high scalability, and security. Therefore, many intelligent computation algorithms are used to improve this environment. In this chapter, an overview of swarm intelligence for solving the scheduling problems of tasks in cloud computing is presented, including particle swarm optimization, cat optimization algorithm, artificial bee colony, lion optimization algorithm, whale optimization algorithm, bat algorithm, gray wolf optimizer, cuckoo search algorithm, hybrid swarm algorithms, and multi-objective swarm optimization. All these algorithms are described and presented with their achievements in solving task scheduling issues in cloud computing.

In the area of cloud computing load balancing, the Particle Swarm Optimization (PSO) algorithm is neoteric and now praised highly, but recently a more neoteric algorithm which deploys the classifier into load balancing is presented. Besides, an algorithm called red-black tree which is aiming at improving the efficiency of resource dispatching is also praised. But the 3 algorithms all have different disadvantages which cannot be ignored. For example, the dispatch efficiency of PSO algorithm is not satisfying; although classifier and red-black tree algorithm improve the efficiency of dispatching tasks, the performance in load balancing is not that good, as a result the improved PSO algorithm is presented. Some researches are designed to get the advantages of new algorithm. First of all, the time complexity and performance for each algorithm in theory are computed; and then actual data which are generated in experiments are given to demonstrate the performance. And from the experiment result, it can be found that for the speed of algorithm itself PSO is the lowest, and the improved PSO solve this problem in some degree; improved PSO algorithm has the best performance in task solving and PSO is the second one, the red-black and Naive Bayes algorithm are much slower; PSO and improved PSO algorithm perform well in load balancing, while the other two algorithms do not do well.

The partial shading of a photovoltaic array repeatedly occurs in the natural environment, which can cause a failure of a conventional maximum power point tracking (MPPT) algorithm. In this paper, the convergence conditions of the standard particle swarm optimization (PSO) algorithm are deduced by the functional analysis, and then the influence of the random variables and inertia factor of the algorithm on the trajectory in the particle swarm optimization is analyzed. Based on the analysis results, an improved particle swarm optimization (IPSO) algorithm, which adopts both global and local modes to locate the maximum power point, is proposed. Compared to the standard PSO algorithm, in the improved PSO algorithm, many random and interfered variables are removed, and the structure is optimized significantly. The proposed algorithm is first simulated in MATLAB to ensure its capability. The feasibility of the approach is validated through physical implementation and experimentation. Results demonstrate that the proposed algorithm has the capability to track the global maximum power point within 3.3 s with an accuracy of 99%. Compared with five recently developed Global MPPT algorithms, the proposed IPSO algorithm achieved better performance in the maximum power tracking in the partial shading conditions.

Standard Particle Swarm Optimization(PSO) algorithm falls into local optima easily and has low convergence accuracy when it is used to address the problem of complex functions optimization.In order to overcome the shortcomings,an improved PSO algorithm was proposed.The proposed algorithm integrated the attraction-repulsion mechanism in the field of biology into PSO algorithm and took full advantage of the mutual influence between particles to modify velocity updating formula,and thus maintained population diversity and enhanced the ability of particle to escape from the local optima.The experimental results demonstrate that the proposed algorithm outperforms two existing variants of the PSO algorithm in terms of convergence accuracy while improving the velocity of convergence in the later evolution phase and avoiding premature convergence problem effectively.

In the research of cloud computing, the advantages and disadvantages of cloud task scheduling algorithm will affect the operation efficiency and service quality of the whole cloud computing system. Evolutionary algorithm is the sum of a series of specific algorithms inspired by the phenomenon of biological evolution in nature. One of the common points of these algorithms is that individuals must be mutated according to certain rules in the running process, so as to avoid falling into local optimum. In order to improve the efficiency of cloud task scheduling in cloud computing, this paper proposes a new mutation strategy which changes the genetic algorithm in evolutionary algorithm. It uses cloudsim platform to simulate cloud task scheduling in cloud computing, and uses particle swarm optimization algorithm to optimize its parameters. The experimental results show that the proposed evolutionary algorithm with improved mutation strategy has the function of cloud task scheduling, and its performance is also improved after the parameters are optimized by particle swarm optimization algorithm. The proposed algorithm improves the mutation step and explores the essence of mutation in evolutionary algorithm, which provides a reference for other research.

The flexibility of cloud computing to provide a dynamic and adaptable infrastructure in the context of information technology and service quality has made it one of the most challenging issues in the computer industry. Task scheduling is a major challenge in cloud computing. Scheduling tasks so that they may be processed by the most effective cloud network resources has been identified as a critical challenge for maximizing cloud computing’s performance. Due to the complexity of the issue and the size of the search space, random search techniques are often used to find a solution. Several algorithms have been offered as possible solutions to this issue. In this study, we employ a combination of the genetic algorithm (GA) and the gravitational emulation local search (GELS) algorithm to overcome the task scheduling issue in cloud computing. GA and the particle swarm optimization (PSO) algorithms are compared to the suggested algorithm to demonstrate its efficacy. The suggested algorithm outperforms the GA and PSO, as shown by the experiments.

Flatness error is an important factor for effective evaluation of surface quality. The existing flatness error evaluation methods mainly evaluate the flatness error of a small number of data points on the micro scale surface measured by CMM, which cannot complete the flatness error evaluation of three-dimensional point cloud data on the micro/nano surface. To meet the needs of nano scale micro/nano surface flatness error evaluation, a minimum zone method on the basis of improved particle swarm optimization (PSO) algorithm is proposed. This method combines the principle of minimum zone method and hierarchical clustering method, improves the standard PSO algorithm, and can evaluate the flatness error of nano scale micro/nano surface image data point cloud scanned by atomic force microscope. The influence of the area size of micro/nano surface topography data on the flatness error evaluation results is analyzed. The flatness evaluation results and measurement uncertainty of minimum region method, standard least squares method, and standard PSO algorithm on the basis of the improved PSO algorithm are compared. Experiments show that the algorithm can stably evaluate the flatness error of micro/nano surface topography point cloud data, and the evaluation result of flatness error is more reliable and accurate than standard least squares method and standard PSO algorithm.

Job-shop scheduling problem is a NP-hard complete. For some JSSP, even with moderate size, optimality can’t be guaranteed. Particle swarm optimization (PSO) algorithm has been developing rapidly and has been applied widely as it is easily understood and realized. This paper presents an improved particle swarm optimization algorithm (IPSO), which uses the dynamic inertia weight that decreases according iterative generation increasing to improve the performance of standard PSO. The proposed IPSO can be used to solve the traditional JSSP and the computational experiments show that the IPSO algorithm is more effective than GA and standard PSO algorithm for JSSP to minimize makespan.

The main objective of this paper is to solve the inverse convection heat transfer problems with particle swarm optimization method. An enhanced particle swarm optimization (EPSO) algorithm is proposed to overcome the shortcoming of earlier convergence of standard PSO algorithms. The performance of EPSO is tested by some benchmark functions; it is shown that EPSO has a strong antilocal trap capability especially for high dimensional multimodal optimization problems. At last, EPSO is used to identify the unknown boundary heat flux in a channel flow. According to the computational results of four test problems, it is clear that the proposed EPSO algorithm is able to estimate the unknown heat flux accurately even when the input data contain measurement error.

Task scheduling, which plays a crucial role in cloud computing and is the critical factor influencing the performance of cloud computing, is an NP-hard problem that can be solved with a heuristic algorithm. In this paper, we propose a novel heuristic algorithm, called biogeography-based optimization (BBO), and a new hybrid migrating BBO (HMBBO) algorithm, which integrates the migration strategy with particle swarm optimization (PSO). Both methods are proposed to solve the problem of scheduling-directed acyclic graph tasks in a cloud computing environment. The basic idea of our approach is to exploit the advantages of the PSO and BBO algorithms while avoiding their drawbacks. In HMBBO, the flight strategy under the BBO migration structure is hybridized to accelerate the search speed, and HEFT_D is used to evaluate the task sequence. Based on the WorkflowSim, a comparative experiment is conducted with the makespan of task scheduling as the objective function. In HMBBO, the flight strategy under the BBO migration structure is hybridized to accelerate the search speed, and HEFT_D is used to evaluate the task sequence. Based on the WorkflowSim, a comparative experiment is conducted with the makespan of task scheduling as the objective function. Both simulation and real-life experiments are conducted to verify the effectiveness of HMBBO. The experiment shows that compared with several classic heuristic algorithms, HMBBO has advantages in terms of global search ability, fast convergence rate and a high-quality solution, and it provides a new method for task scheduling in cloud computing.

Particle Swarm Optimization (PSO) is a new metaheuristic algorithm based on the social behavior of animals. PSO is widely growing and accepted among researchers to find the optimum solution in very large space with low computational complexity. There are various controlled parameters in PSO,and inertia weight (IW) is one of them. An appropriate strategy for varying inertia weight improves the PSOperformance. Recent research works related to varying inertia weight strategy considered small values of w, generally between 0 and 1.The aim of this research paper is to investigate existing varying inertia weight strategy, their effect on PSO performance and to design the new variant of IW for better performance. The same strategy have been implemented in two different proposed inertia weight variants of PSO, namely Modified Simple Random Inertia Weight (MSRIW), and Modified Oscillating Inertia Weight (MOIW). We compared the performance of proposed variants with different existing inertia weight variants of PSO. The proposed strategy is better than existing in term of convergence speed. Further this strategy can be implemented for task scheduling in cloud computing for better performance.

Neural Network system for SoC is one topic in the world. Recently, SoC began to combine AI technique by Python. When developers consider Intelligent system on SoC, the co-design software and hardware are significant. In this case, small devices and embedded system are target system. For IoT, those techniques will grow up in the world. Those cases, avoiding premature convergence while keeping performance is a challenge in training the neural network, especially in a case of large NNs or a large number of training data. In this case, one problem is a huge memory and processing power. For tiny memory and processing system as SoC, we propose an improved particle swarm optimization (PSO) algorithm called the PSOseed2 algorithm for training NN. The PSOseed2 algorithm solves the premature convergence of the standard PSO (SPSO) algorithm by slightly modifying the velocity update function without adding many computational tasks to the SPSO algorithm. We evaluated this algorithm on field programmable gate array (FPGA)-based NN and software-based NN and trained these NNs with different PSO algorithms that are SPSO, PSOseed, PSOseed2, and dissipative PSO. Experimental results with different datasets confirmed that the NNs trained by the proposed PSOseed2 algorithm had better recognition rates and lower global learning errors than the NN trained by other PSO algorithms. In this talk, I would like to talk those relational research in the world and our results and discussion.

Task scheduling in cloud computing based on grey wolf optimization with a new encoding mechanism

In order to improve the stability and sensitivity of particle swarm optimization (PSO) algorithm and to solve the problem of premature convergence, in this re-search, a computer PSO algorithm based on thermodynamic motion mechanism is proposed based on the principle of thermodynamic motion mechanism. Firstly, the thermodynamic motion phenomenon, the diffusion law in kinematics and the standard PSO algorithm are introduced. Then, according to the basic idea of thermodynamic motion mechanism, the standardized PSO algorithm is optimized and its optimization process is introduced. Finally, the experimental results are analysed by setting the test function. The results show that among the five test functions, the computer PSO algorithm based on thermodynamic motion mechanism has a higher probability of jumping out of the local optimal solution. Its robustness and stability are much better than standard PSO algorithms. The evolution ability of the computer PSO algorithm based on thermodynamic motion mechanism is better than that of the standard PSO algorithm. The standard PSO algorithm is superior because it is based on thermodynamic motion mechanism. The research in this paper can provide good guidance for improving the performance of PSO algorithm.