- Research Article
7
- 10.1002/cpe.4517
Cloud computing and big data: Technologies and applications
- May 20, 2018
- Concurrency and Computation: Practice and Experience
- Mostapha Zbakh + 3 more +3
Cloud computing and big data: Technologies and applications
Cloud Computing is a cutting edge technology for managing and delivering services over the Internet. Map-Reduce is the programming model used in cloud computing for processing large data sets in parallel over huge clusters. In order to increase efficiency, a good task scheduling is needed. Genetic algorithms are very useful and accurate in finding solutions to large scale optimization problems, such as task scheduling. They have gained immense popularity over last few years as a robust and easily adaptable search technique. Hadoop, the open source implementation of Map-Reduce, has several task schedulers available (FIFO, Fair, Capacity Schedulers), but neither one of them is focused on minimizing the global execution time. The goal of this project is to improve Hadoop's functionality by implementing a scheduler based on a genetic algorithm, solving the stated problem.
Cloud computing and big data: Technologies and applications
Cloud computing and big data: Technologies and applications
Task scheduling optimization in heterogeneous cloud computing environments: A hybrid GA-GWO approach
Task scheduling optimization in heterogeneous cloud computing environments: A hybrid GA-GWO approach
Semantic service composition model based on cloud computing
The user group encountered in cloud computing is large, and the amount of tasks and data to be processed is also large. How to schedule tasks effectively becomes an important problem that can be solved in cloud computing. A binary fitness genetic algorithm (DFGA) is proposed, which is aimed at the programming model of cloud computing. Not only can the algorithm find a plan result with a short overall task completion time, but the short-term performance of the plan result is relatively short. The algorithm was compared with the adaptive genetic algorithm (AGA) through simulation experiments in a short time. The experimental results show that the algorithm is superior to the adaptive genetic algorithm and is an effective task planning algorithm in the cloud computing environment. Genetic algorithm is a global heuristic algorithm used to solve optimization problems. It is adaptive, learning, and parallel. Genetic algorithms have great advantages, especially when dealing with a large number of tasks. Tasks are assigned to multiple processors for processing simultaneously. At the same time, genetic algorithms are also extensible, which can be easily combined with other algorithms to absorb the advantages of other algorithms to make up for their own shortcomings. At present, many authors of scientific research have used the advantages of genetic algorithms to apply them to task scheduling problems, and the scheduling results obtained are superior to traditional scheduling solutions. This paper studies the task scheduling algorithm based on improved genetic algorithm in cloud computing environment. This article uses CloudSim as the object, and through data analysis, compared with HEFT, the SLR of the HEFTD algorithm is shortened by 10.55%, 8.99%, 16.99%, 19.79%, and 9.89%, that is, HEFTD in different CCR. When the CCR is 1 and 2, the algorithm performance is greatly improved.
Read moreResearch on Optimization Strategy of Task Scheduling Software Based on Genetic Algorithm in Cloud Computing Environment
In order to improve the task scheduling strategy, a method based on genetic algorithm in cloud computing environment was proposed. First, the independent task scheduling algorithm and associated task scheduling algorithm commonly used in cloud computing are studied and compared, respectively, and their application characteristics, advantages, and disadvantages are analyzed in detail. Second, an independent task scheduling strategy based on multipopulation genetic algorithm is proposed for independent task scheduling in cloud environment, considering the scheduling time, scheduling cost, and system resource utilization of task set. The implementation steps of the algorithm are given in detail. Finally, the simulation experiment is carried out on Cloud Sim platform. The experimental results show that computing resource M is 10, subtask N is 2000, population size S is 80, and ETC matrix and RCU array are randomly generated by the system. As the number of iterations increases, the scheduling scheme formed by MCGA and CGA is more obvious and close to the subtask execution cost optimization. Finally, the optimized scheme is basically formed. However, the scheduling scheme formed by TGA has no obvious optimization effect on the subtask execution cost. It is proved that the algorithm proposed in this paper can effectively optimize the task scheduling efficiency and improve the utilization of cloud computing resources at the same time, providing a feasible idea and method for task scheduling in the cloud computing environment.
Read moreGenetic Algorithm-Based Task Scheduling in Cloud Computing Using MapReduce Framework
Task scheduling is an essential component of any distributed system because it routes tasks to appropriate resources for execution, such as grids, clouds, and peer-to-peer networks. Common scheduling algorithms include downsides, such as high temporal complexity, non-simultaneous processing of input tasks, and longer program execution times. Exploration-based scheduling algorithms prioritize tasks using a variety of methods, resulting in long execution times on heterogeneous distributed computing systems. As a result, task prioritization becomes a bottleneck in such systems. It is appropriate to prioritize tasks with the shortest execution time using faster algorithms. The genetic algorithm (GA) is one of the evolutionary approaches used to solve complex problems quickly. This paper proposes a parallel GA with a MapReduce architecture for scheduling jobs on cloud computing with various priority queues. The fundamental aim of this study is to employ a MapReduce architecture to minimize the total execution time of the task scheduling process in the cloud computing environment. The proposed method accomplishes task scheduling in two stages: first, the GA was used in conjunction with heuristic techniques to assign tasks to processors, and then the GA was used in conjunction with the MapReduce framework to assign jobs to processors. In our experiments, we consider heterogeneous resources that differ in their ability to execute various tasks, as well as running a job on different resources with varying execution durations. The results show that the proposed method outperforms other algorithms such as particle swarm optimization, whale optimization algorithm, moth-flame optimization, and intelligent water drops.
Read moreA Hybrid Gravitational Emulation Local Search‐Based Algorithm for Task Scheduling in Cloud Computing
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.
Read moreTask Scheduling Algorithms for Cloud Computing Resource Allocation: A Systematic Analysis Environment
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.
Read moreTask Scheduling in Cloud Computing using Lion Optimization Algorithm
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.
Read moreAn efficient task scheduling in a cloud computing environment using hybrid Genetic Algorithm - Particle Swarm Optimization (GA-PSO) algorithm
Cloud computing provides the computational machines as a support of the clients utilizing cloud organize. In cloud computing, the user inputs are executed with required machines to convey the administrations. Numerous task scheduling methods are utilized to plan the client tasks to the machines. In this paper, another successful hybrid task scheduling is proposed to minimize the total execution time using Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) algorithms. In hybrid Genetic Algorithm - Particle Swarm Optimization (GA-PSO) algorithm, PSO helped GA to obtain better results compare to a standard genetic algorithm, Min-Min, and Max-Min algorithms results.
Read moreAn Efficient Task Scheduling Based on Seagull Optimization Algorithm for Heterogeneous Cloud Computing Platforms
Cloud computing provides computing resources like software and hardware as a service by the network for several users. Task scheduling is one of the main problems to attain cost-effective execution. The main purpose of task scheduling is to allocate tasks to resources so that it can optimize one or more criteria. Since the problem of task scheduling is one of the Nondeterministic Polynomial-time (NP)-hard problems, meta-heuristic algorithms have been widely employed for solving task scheduling problems. One of the new bio-inspired meta-algorithms is Seagull Optimization Algorithm (SOA). In this paper, we proposed an energy-aware and cost-efficient SOA-based Task Scheduling (SOATS) algorithm. The aims of proposed algorithm to make a trade-off between five objectives (i.e., energy consumption, makespan, cost, waiting time, and load balancing) using a fewer number of iterations. The experiment results by comparing with several meta-heuristic algorithms (i.e., Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and Whale Optimization Algorithm (WOA)) prove that the proposed technique performs better in solving task scheduling problem. Moreover, we compared the proposed algorithm with well-known scheduling methods: Cost-based Job Scheduling (CJS), Moth Search Algorithm based Differential Evolution (MSDE), and Fuzzy-GA (FUGE). In the heavily loaded environment, the SOATS algorithm improved energy consumption and cost saving by 10 and 25%, respectively.
Read moreA Novel Dynamic Task Scheduling Algorithm Based on Improved Genetic Algorithm in Cloud Computing
Task scheduling method of cloud computing is the key step to achieve its high performance computing. In order to effectively solve the problem of task scheduling in cloud computing, this paper proposes a novel dynamic task scheduling algorithm based on improved genetic algorithm. On the basis of the genetic algorithm, the proposed algorithm gives full consideration to the dynamic characteristics of the cloud computing environment. The CloudSim simulation platform is selected for simulation; experimental results show that the proposed algorithm can effectively improve the throughput of cloud computing systems, and can significantly reduce the execution time of task scheduling.
Read moreLGSA: Hybrid Task Scheduling in Multi Objective Functionality in Cloud Computing Environment
Cloud computing turns to be a big shift from the conventional perception of the IT resources. It is a transpiring computing technology that is increasingly stabling itself as the promising future of distributed on-demand computing. The processes comprised in it are the ones that act as a vital backbone and which strengthen the entire stream of cloud computing as a whole. In specific, Task scheduling is the one such phenomena that enhances the cloud computing in terms of performance. Hence task scheduling that is considered as a predominant one amidst others is what this paper comprises all about. Maximizing the profit via assigning the whole task to the virtual machine is what the problem of scheduling deals with. Although there prevails many more ways to resolve this problem, this paper explores one such solution that consumes lesser number of resources, having lower cost and much importantly consuming lesser energy. By making a profound research regarding this approach of scheduling so as to represent the multi-objective function, both lion optimization algorithm and gravitational search algorithm are hybridized. In spite of having certain drawbacks which could be avoided although, the brighter side relies the merits of making use of both lion search and gravitational search algorithm. There could be many means of measurement for computing the performance of the algorithm. The different algorithms that aid to depict the comparable study encompasses gravitational search algorithm, genetic algorithm and lion, particle swarm optimization. The experimental results serve as the evident for depicting the bitterness of our proposed algorithm compared to the prevailing approaches. As an unexplored path may seem trivial but is effective so does the betterment of our lion approach.
Read moreFleet management system for mobile robots in healthcare environments
Purpose: The purpose of this paper is to describe the implementation of a Fleet Management System (FMS) that plans and controls the execution of logistics tasks by a set of mobile robots in a real-world hospital environment. The FMS is developed upon an architecture that hosts a routing engine, a task scheduler, an Endorse Broker, a controller and a backend Application Programming Interface (API). The routing engine handles the geo-referenced data and the calculation of routes; the task scheduler implements algorithms to solve the task allocation problem and the trolley loading problem using Integer Linear Programming (ILP) model and a Genetic Algorithm (GA) depending on the problem size. The Endorse Broker provides a messaging system to exchange information with the robotic fleet, while the controller implements the control rules to ensure the execution of the work plan. Finally, the Backend API exposes some FMS to external systems.Design/methodology/approach: The first part of the paper, focuses on the dynamic path planning problem of a set of mobile robots in indoor spaces such as hospitals, laboratories and shopping centres. A review of algorithms developed in the literature, to address dynamic path planning, is carried out; and an analysis of the applications of such algorithms in mobile robots that operate in real in-door spaces is performed. The second part of the paper focuses on the description of the FMS, which consists of five integrated tools to support the multi-robot dynamic path planning and the fleet management.Findings: The literature review, carried out in the context of path planning problem of multiple mobile robots in in-door spaces, has posed great challenges due to the environment characteristics in which robots move. The developed FMS for mobile robots in healthcare environments has resulted on a tool that enables to: (i) interpret of geo-referenced data; (ii) calculate and recalculate dynamic path plans and task execution plans, through the implementation of advanced algorithms that take into account dynamic events; (iii) track the tasks execution; (iv) fleet traffic control; and (v) to communicate with one another external systems.Practical implications: The proposed FMS has been developed under the scope of ENDORSE project that seeks to develop safe, efficient, and integrated indoor robotic fleets for logistic applications in healthcare and commercial spaces. Moreover, a computational analysis is performed using a virtual hospital floor-plant.Originality/value: This work proposes a novel FMS, which consists of integrated tools to support the mobile multi-robot dynamic path planning in a real-world hospital environment. These tools include: a routing engine that handles the geo-referenced data and the calculation of routes. A task scheduler that includes a mathematical model to solve the path planning problem, when a low number of robots is considered. In order to solve large size problems, a genetic algorithm is also implemented to compute the dynamic path planning with less computational effort. An Endorse broker to exchanges information between the robotic fleet and the FMS in a secure way. A backend API that provides interface to manage the master data of the FMS, to calculate an optimal assignment of a set of tasks to a group of robots to be executed on a specific date and time, and to add a new task to be executed in the current shift. Finally, a controller to ensures that the robots execute the tasks that have been assigned by the task scheduler.
Read moreA Survey of Swarm Intelligence for Task Scheduling in Cloud Computing
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.
Read moreTask Scheduling Algorithm in Cloud Computing Based on Fairness Load Balance and Minimum Completion Time
Task scheduling is one of the key technology of cloud computing, its main goal is to satisfy the fairness of the system resources and tasks more effectively, and at the same time as much as possible to realize the load balance of system resources and reduce the completion time. Combined with the advantages of genetic Algorithm, we put forward a Fair and Balanced and effective genetic Scheduling Algorithm FBEGSA (Fair Balanced Efficient Genetic Scheduling Algorithm).The experimental results show that the algorithm is useful to task scheduling.
Read more