Improved Hybrid DLBS Artificial Bee Colony Optimization Algorithm based on Parallel Computing Environment

  title={Improved Hybrid DLBS Artificial Bee Colony Optimization Algorithm based on Parallel Computing Environment},
  author={Bhuvnesh Pathania and Abhilasha Sharma},
  journal={International Journal of Computer Applications},
This paper represents the Parallel Computing is now extremely popular because of its wide variety of applications through internet. The particular service based approaches which are aware from the server selection through the parallel can easily progress toward the cost and performance of parallel computing. A new hybrid DLBS Artificial bee colony optimization algorithm for parallel computing environment has been done. The overall objective of this paper is enlighten the performance analysis on… Expand
2 Citations
Improved Hybrid Algorithm Approach based Load Balancing Technique in Cloud Computing
Effective services can be provided to the end user only when proper scheduling of tasks are done in peak hours when heterogeneous collection of requests are coming to the data center. Expand


An Analysis of Task Scheduling in Cloud Computing using Evolutionary and Swarm-based Algorithms
This paper analyzes various evolutionary and swarm based task scheduling algorithms that address the problem of escalating costs of data intensive applications. Expand
Energy optimization for task scheduling in distributed systems by an Artificial Bee Colony approach
The best algorithm, MOABC, is compared with MOHEFT, the most popular algorithm for workflow scheduling and with two real grid schedulers as WMS or DBC and the results point out MOABC as the best approach in all the cases studied. Expand
Genetic algorithm and ant colony algorithm based Energy-Efficient Task Scheduling
  • Jianfeng Zhao, Hongze Qiu
  • Computer Science
  • 2013 IEEE Third International Conference on Information Science and Technology (ICIST)
  • 2013
A duplication based method to reach multiple targets, including reducing the executing time and energy cost is proposed, with a new dynamic fusion strategy proposed to gain the optimal solution quickly. Expand
Job Scheduling Model for Cloud Computing Based on Multi- Objective Genetic Algorithm
Compared to existing scheduling algorithms, the results show that the proposed MO-GA algorithm can obtain a better solution, and it provides a balance for the performance of multiple objects. Expand
An ant colony optimization for dynamic job scheduling in grid environment
A general framework of grid scheduling using dynamic information and an ant colony optimization algorithm to improve the decision of scheduling is developed and found that the scheduling system using an Ant Colony Optimization algorithm can efficiently and effectively allocate jobs to proper resources. Expand
Hybrid Job Scheduling Algorithm for Cloud Computing Environment
A hybrid job scheduling approach, which considers the load balancing of the system and reduces total execution time and execution cost and average Degree of Imbalance (DI). Expand
A Metaheuristic Algorithm for Job Scheduling in Grid Computing
This paper introduces CUckoo-Genetic Algorithm (CUGA), which inspired from cuckoo optimization algorithm (COA) with genetic algorithm (GA) for job scheduling in grids, and shows that the proposed algorithm is more efficient and provides higher performance. Expand
Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems
This paper presents a hybrid Pareto-based discrete artificial bee colony algorithm for solving the multi-objective flexible job shop scheduling problem. In the hybrid algorithm, each solutionExpand
A two-phase heuristic for the energy-efficient scheduling of independent tasks on computational grids
This convergence study suggests how additional energy reduction can be achieved by inserting low power computing nodes to the distributed computer system. Expand
A conceptual comparison of the Cuckoo-search, particle swarm optimization, differential evolution and artificial bee colony algorithms
Empirical results reveal that the problem solving success of the CK algorithm is very close to the DE algorithm and the run-time complexity and the required function-evaluation number for acquiring global minimizer by theDE algorithm is generally smaller than the comparison algorithms. Expand