A Novel Firefly Algorithm for Scheduling Bag-of-Tasks Applications Under Budget Constraints on Hybrid Clouds

Abstract

This paper aims at scheduling bag-of-tasks (BoT) applications under budget constraints on hybrid clouds for minimizing the makespan. To solve this NP-hard problem, we propose a novel firefly algorithm (NFA) in which the evaluation of a firefly consists of two steps: (1) mapping a firefly to a scheduling solution (a task sequence); (2) calculating the solution's objective (its corresponding makespan). In the first step, different from the well-known ranked-order value (ROV) rule, we propose a distancebased mapping operator that relies on the distance between a firefly and the brightest one to determine the mapping relationship between a firefly and a solution. We use a probability model in which solutions corresponding to fireflies closer to the brightest one would have higher probabilities to inherit tasks from the current best solution. In this manner, these solutions can inherit more ''good genes'' hidden inside the current best solution to evolve into more high-quality solutions. In the second step, we employ an effective heuristic to evaluate solution objectives. We further develop a composite heuristic to generate the initial best solution, providing the proposed NFA with a good start. We also establish a new movement scheme such that fireflies distant from the brightest one can explore a wide range in the search space, whereas fireflies nearby the brightest one can search in a small neighborhood. Experimental results show that, by employing the above-mentioned strategies, NFA outperforms the standard firefly algorithm and the existing best algorithm, in terms of scheduling effectiveness and computational efficiency. Specifically, the distance-based mapping operator is verified to be both more effective and more efficient than the ROV rule. The composite heuristic is capable of generating a good initial solution, leading to the high quality of the final schedule. The movement scheme can further reduce the makespan of BoT applications.

Improved Hybrid Firefly Algorithm with Probability Attraction Model

“…Table 25 shows that 14 intelligence optimization algorithms are used to solve Equation (13) and the best result of various algorithms solving Problem 1. To better evaluate the performance of the algorithm, the minimum optimal value (Best), maximum optimal value (Worst), average optimal value (Mean) and standard deviation of optimal value (Std) are taken as statistical indicators.…”

“…FA has the advantages of simple principles, few parameters, easy implementation, high precision and fast convergence. Therefore, the firefly algorithm is implemented to solve various problems in different domains, such as neural networks [7][8][9], scheduling problems [10][11][12], image processing [9,13], wireless parameter optimization of sensor networks [14][15][16] and big data processing [17,18].…”

A Hybrid Teaching-Learning-Based Optimization Algorithm for the Travel Route Optimization Problem alongside the Urban Railway Line

“…The implementation process of the above two rules are illustrated in Figure 5. The decoding process includes two parts: ranked-order value (ROV) and roulette wheel rules [26,27]. ROV rule is used to convert a real number array into an integer sequence.…”

Hybrid RSO Algorithm with SFLA for Scientific Workflow Scheduling in Cloud Using Clustering Techniques

“…The Shu ed Frog Leaping Algorithm (SFLA) is based on swarm evolution that imitates information exchange divided into memeplexes when searching for food. There is a need for a mixture of global search and local search in the memeplex to develop the algorithm to arrive at an optimal solution [17].…”