A checkpointed league championship algorithm-based cloud scheduling scheme with secure fault tolerance responsiveness

Cloud computing system is a huge cluster of interconnected servers residing in a datacenter and dynamically provisioned to clients on-demand via a front-end interface. Scientific applications scheduling in the cloud computing environment is identified as NP-hard problem due to the dynamic nature of heterogeneous resources. Recently, a number of metaheuristics optimization schemes have been applied to address the challenges of applications scheduling in the cloud system, without much emphasis on the issue of secure global scheduling. In this paper, scientific applications scheduling techniques using the Global League Championship Algorithm (GBLCA) optimization technique is first presented for global task scheduling in the cloud environment. The experiment is carried out using CloudSim simulator. The experimental results show that, the proposed GBLCA technique produced remarkable performance improvement rate on the makespan that ranges between 14.44% to 46.41%. It also shows significant reduction in the time taken to securely schedule applications as parametrically measured in terms of the response time. In view of the experimental results, the proposed technique provides better-quality scheduling solution that is suitable for scientific applications task execution in the Cloud Computing environment than the MinMin, MaxMin, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) scheduling techniques.

The crowd-creation space is a manifestation of the development of innovation theory to a certain stage. With the creation of the crowd-creation space, the problem of optimizing the resource allocation of the crowd-creation space has become a research hotspot. The emergence of cloud computing provides a new idea for solving the problem of resource allocation. Common cloud computing resource allocation algorithms include genetic algorithms, simulated annealing algorithms, and ant colony algorithms. These algorithms have their obvious shortcomings, which are not conducive to solving the problem of optimal resource allocation for crowd-creation space computing. Based on this, this paper proposes an In the cloud computing environment, the algorithm for optimizing resource allocation for crowd-creation space computing adopts a combination of genetic algorithm and ant colony algorithm and optimizes it by citing some mechanisms of simulated annealing algorithm. The algorithm in this paper is an improved genetic ant colony algorithm (HGAACO). In this paper, the feasibility of the algorithm is verified through experiments. The experimental results show that with 20 tasks, the ant colony algorithm task allocation time is 93ms, the genetic ant colony algorithm time is 90ms, and the improved algorithm task allocation time proposed in this paper is 74ms, obviously superior. The algorithm proposed in this paper has a certain reference value for solving the creative space computing optimization resource allocation.

Inspired by the competition of sport teams in a sport league, the League Championship Algorithm (LCA) has been introduced recently for optimizing nonlinear continuous functions. LCA tries to metaphorically model a league championship environment wherein a number of individuals, as artificial sport teams, play in pairs in an artificial league for several weeks (iterations) based on a league schedule. Given the playing strength (fitness value) along with a team intended formation (solution) in each week, the game outcome is determined in terms of win or loss and this will serve as a basis to direct the search toward fruitful areas. At the heart of LCA is the artificial post-match analysis where, to generate a new solution, the algorithm imitates form the strengths/ weaknesses/ opportunities/ threats (SWOT) based analysis followed typically by coaches to develop a new team formation for their next week contest. In this paper we try to modify the basic algorithm via modeling a between two halves like analysis beside the postmatch SWOT analysis to generate new solutions. Performance of the modified algorithm is tested with that of basic version and the particle swarm optimization algorithm (PSO) on finding the global minimum of a number of benchmark functions. Results testify that the improved algorithm called RLCA, performs well in terms of both final solution quality and convergence speed.

The emergence of Cloud Computing has brought new dimension to the world of information technology. Even though Cloud Computing provide various benefits like agility, on-demand provisioning of resources, reduced cost, multi-tenancy etc., there are risks and flaws associated with it. One key research challenge in Cloud Computing is to ensure continuous reliability and guaranteed availability of resources provided by it. So there is a need for a robust Fault Tolerant (FT) system in Cloud Computing. To better understand FT in Cloud Computing, it is essential to understand the different types of faults. In this paper, we highlight the basic concepts of fault tolerance by understanding the different FT policies like Reactive FT policy and Proactive FT policy and the associated FT techniques used on different types of faults. A study on various fault tolerant methods, algorithms, frameworks etc., has been carried out which are developed and implemented by research experts in this field. This is an area where lot of research is happening and these studies will guide us to build a robust FT technique in Cloud.

This paper presents a methodology to solve the manufacturing cell creation and the production scheduling problems for designing virtual cellular manufacturing systems (VCMSs). The objective is to minimize the total materials and components travelling distance incurred. The methodology consists of (i) a mathematical model that describes the characteristics of a VCMS and includes constraints such as delivery due dates of products, maximum capacities of resources, critical tools limitation, and (ii) an ant colony optimization (ACO) algorithm for manufacturing cell formation and production scheduling. Since the proposed ACO algorithm does not indicate a feasible schedule explicitly, two simple heuristics are developed to assign workstations to the operations of the jobs, and to construct the final schedule. To demonstrate the effectiveness of the proposed methodology, both the ACO algorithm and the genetic algorithm are applied to design manufacturing cells for a company in China producing internal combustion engine components. Comparison of the results obtained with the results supplied by the company on the existing manufacturing system show that both the ACO algorithm and the genetic algorithm together with the virtual cellular manufacturing concept perform better than the current manufacturing practice in terms of average workstation utilization, product completion time and system throughput. Also, the results of a set of randomly generated numerical experiments show that the proposed ACO algorithm generates excellent final solutions in a much shorter computation time when compared with the genetic algorithm. Therefore, the mathematical model and the ACO algorithm proposed in this paper form a simple, but effective and efficient methodology to solve the manufacturing cell creation and production scheduling problems for designing VCMSs.

This paper presents a method of optimized PID parameter self-adapted ant colony algorithm with aberrance gene, based on ant colony algorithm. This method overcomes genetic algorithm’s defects of repeated iteration, slower solving efficiency, ordinary ant colony algorithm’s defects of slow convergence speed, easy to get stagnate, and low ability of full search. For a given system, the results of simulation experiments which compare to the result of Z-N optimization and evolution of genetic algorithm optimization and evolution of ant colony system optimization, it has more excellent performance in finding best solution and convergence, the PID parameters also have optimality, system possesses dynamic controlling and performance. The experiments show that this method has its practical value on controlling other objection and process.

Interferometric Synthetic Aperture Radar (InSAR) is a microwave imaging system with all-weather earth observation. Because of its wide observation area, high precision, day and night operational capabilities, it has a significant advantage in monitoring large-scale surface deformation. Phase unwrapping is a key step in InSAR data processing. The core of Goldstein traditional branch unwrapping method is the establishment of branch-cutting lines. The shorter the overall length of the branch line, the solution is more accurate. Based on the idea of solving the shortest path of Travelling Salesman Problem (TSP), a new algorithm combining ant colony algorithm and genetic algorithm is proposed. Based on the advantages of these two algorithms, we avoid the disadvantages of excessive parameters, slow calculation speed and low efficiency in ant colony algorithm, reduce the time consumed by ant colony algorithm in solving local optimal solution, improve the local search ability of ant colony algorithm, establish shorter branch line than traditional branch method, prevent islanding effect and improve the precision of phase unwrapping. The tests performed on real and simulated interferometric SAR data confirm the validity of the proposed method.

This paper presents a novel intelligent and effective method based on an improved ant colony optimization (ACO) algorithm to solve the multi-objective ship weather routing optimization problem, considering the navigation safety, fuel consumption, and sailing time. Here the improvement of the ACO algorithm is mainly reflected in two aspects. First, to make the classical ACO algorithm more suitable for long-distance ship weather routing and plan a smoother route, the basic parameters of the algorithm are improved, and new control factors are introduced. Second, to improve the situation of too few Pareto non-dominated solutions generated by the algorithm for solving multi-objective problems, the related operations of crossover, recombination, and mutation in the genetic algorithm are introduced in the improved ACO algorithm. The final simulation results prove the effectiveness of the improved algorithm in solving multi-objective weather routing optimization problems. In addition, the black-box model method was used to study the ship fuel consumption during a voyage; the model was constructed based on an artificial neural network. The parameters of the neural network model were refined repeatedly through the historical navigation data of the test ship, and then the trained black-box model was used to predict the future fuel consumption of the test ship. Compared with other fuel consumption calculation methods, the black-box model method showed higher accuracy and applicability.

Metaheuristics algorithms show very good performance in solving various job scheduling problems in computational grid systems. However, due to the complexity and heterogeneous nature of resources in grid computing, stand-alone algorithm is not capable to find a good quality solution in reasonable time. This study proposes a hybrid algorithm, specifically ant colony system and genetic algorithm to solve the job scheduling problem. The high level hybridization algorithm will keep the identity of each algorithm in performing the scheduling task. The study focuses on static grid computing environment and the metrics for optimization are the makespan and flowtime. Experiment results show that the proposed algorithm outperforms other stand-alone algorithms such as ant system, genetic algorithms, and ant colony system for makespan. However, for flowtime, ant system and genetic algorithm perform better.

Airport information weak current system is the core of airport terminal, which is responsible for information interaction, power resource and energy consumption management among subsystems of airport terminal. Meanwhile, it is also responsible for main business dispatch management of entire airport terminal. Therefore, starting with basic ant colony algorithm and considering respective advantages of genetic and ant colony algorithms, optimization cycle of the two algorithms is introduced multiple times in this paper. Moreover, after each loop iteration of ant colony algorithm, optimal solution generated by ant colony algorithm will be added to genetic algorithm so that iterative speed of genetic algorithm can be accelerated. Meanwhile, solution calculated by genetic algorithm will be set to better path to update pheromone allocation in ant colony algorithm and achieve parameter adjustment. Experimental test proves that geneticant colony hybrid algorithm proposed in this paper has good convergence and solution efficiency, which can find the shortest path with suitable conditions in complex road networks.

Cloud computing provides resources as services to customs by using virtualization technology. When virtual machines (VMs) are hosted on physical servers, there seem to be a chief concern that the way of intermediate and industrializing countries to deal with the great energy consumed by maintaining the servers in data centers. Therefore, the VM placement (VMP) problem is significant in both energy optimization and cloud computing. In this paper we propose a heuristic approach based on an improved ant colony algorithm (ACA) to solve the VMP problem, named as GACA-VMP. G is presented for genetic, that means the algorithm will conjunction with the genetic algorithm to solve the problem. By analyzing the pheromone during the ant movements, which is defined in ant placement between VM pairs, then the algorithm optimize the calculation of pheromone in load balancing theory, that is how we can select the suitable selection results. We evaluate the performance of the proposed GACA-VMP approach in solving VMP compared with the ones obtained with the simple ant colony algorithm (ACA), and the first-fit decreasing (FFD) algorithm. The results show that GACA-VMP can solve VMP more efficiently to select the opportune number of physical servers, together with remarkable resource utilization.

In cloud computing, all kinds of idle resources can be pooled to establish a resource pool, and different kinds of resources combined as a service is provided to users through virtualization. Therefore, an effective mechanism is necessary for managing and allocating the resources. In this paper, we propose a double combinatorial auction based allocation mechanism based on the characteristics of cloud resources and inspired by the flexibility and effectiveness of microeconomic methods. The feedback evaluation based reputation system with attenuation coefficient of time and the hierarchy of users introduced is implemented to avoid malicious behavior. In order to make decisions scientifically, we propose a price decision mechanism based on a BP (back propagation) neural network, in which various factors are taken into account, so the bidding/asking prices can adapt to the changing supply-demand relation in the market. Since the winner determination is an NP hard problem, a league championship algorithm is introduced to achieve optimal allocation with the optimization goals being market surplus and total reputation. We also conduct empirical studies to demonstrate the feasibility and effectiveness of the proposed mechanism.Keywordscloud computingdouble combinatorial auctionreputationBP neural networkleague championship algorithm

Task scheduling in cloud computing environments is crucial for optimizing resource allocation and enhancing system efficiency.In this paper, we present a systematic analysis environment for evaluating various task scheduling algorithms.We focus on three prominent algorithms: Ant Colony Optimization (ACO), Round Robin, and Genetic Algorithm (GA).Each algorithm offers unique strengths and trade-offs, making them suitable for different cloud computing scenarios.Firstly, we delve into the principles of Ant Colony Optimization, leveraging the collective intelligence of artificial ants to find optimal task assignments in a distributed manner.Secondly, Round Robin, a simple yet effective algorithm, cyclically allocates tasks among available resources, ensuring fair utilization.Lastly, Genetic Algorithm, inspired by natural selection processes, evolves task scheduling solutions over successive generations, adapting to dynamic workload conditions.

Cloud computing has spread fast because of its high performance distributed computing. It offers services and access to shared resources to internet users through service providers. Efficient performance of task scheduling in clouds is one of the most important research issues which needs to be focused on. Various task scheduling algorithms for cloud based on metaheuristic techniques have been examined and showed high performance in reasonable time such as scheduling algorithms based on Ant Colony Optimization (ACO), Genetic Algorithm (GA), and Particle Swarm Optimization (PSO). In this paper, we propose a new task-scheduling algorithm based on Lion Optimization Algorithm (LOA), for cloud computing. LOA is a nature-inspired population-based algorithm for obtaining global optimization over a search space. It was proposed by Maziar Yazdani and Fariborz Jolai in 2015. It is a metaheuristic algorithm inspired by the special lifestyle of lions and their cooperative characteristics. The proposed task scheduling algorithm is compared with scheduling algorithms based on Genetic Algorithm and Particle Swarm Optimization. The results demonstrate the high performance of the proposed algorithm, when compared with the other algorithms.

The cloud computing systems are sorts of shared collateral structure which has been in demand from its inception. In these systems, clients are able to access existing services based on their needs and without knowing where the service is located and how it is delivered, and only pay for the service used. Like other systems, there are challenges in the cloud computing system. Because of a wide array of clients and the variety of services available in this system, it can be said that the issue of scheduling and, of course, energy consumption is essential challenge of this system. Therefore, it should be properly provided to users, which minimizes both the cost of the provider and consumer and the energy consumption, and this requires the use of an optimal scheduling algorithm. In this paper, we present a two-step hybrid method for scheduling tasks aware of energy and time called Genetic Algorithm and Energy-Conscious Scheduling Heuristic based on the Genetic Algorithm. The first step involves prioritizing tasks, and the second step consists of assigning tasks to the processor. We prioritized tasks and generated primary chromosomes, and used the Energy-Conscious Scheduling Heuristic model, which is an energy-conscious model, to assign tasks to the processor. As the simulation results show, these results demonstrate that the proposed algorithm has been able to outperform other methods.