Task Allocation for Maximizing Reliability of Distributed Computer Systems
IEEE Transactions on Computers
Algorithms for reliability-oriented module allocation in distributed computing systems
Journal of Systems and Software
A hybrid heuristic to solve a task allocation problem
Computers and Operations Research
Journal of Parallel and Distributed Computing
Journal of Systems Architecture: the EUROMICRO Journal
Reliability and cost optimization in distributed computing systems
Computers and Operations Research
Task allocation for maximizing reliability of distributed systems: a simulated annealing approach
Journal of Parallel and Distributed Computing
Journal of Systems and Software
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems
Computer Standards & Interfaces
A hybrid honey bees mating optimization algorithm for the probabilistic traveling salesman problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A fast algorithm for reliability-oriented task assignment in a distributed system
Computer Communications
A hierarchical reliability-driven scheduling algorithm in grid systems
Journal of Parallel and Distributed Computing
Task allocation in distributed computing systems using adaptive particle swarm optimisation
International Journal of Computer Applications in Technology
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
This paper deals with the problem of task allocation (i.e., to which processor should each task of an application be assigned) in heterogeneous distributed computing systems with the goal of maximizing the system reliability. The problem of finding an optimal task allocation is known to be NP-hard in the strong sense. We propose a new swarm intelligence technique based on the honeybee mating optimization (HBMO) algorithm for this problem. The HBMO based approach combines the power of simulated annealing, genetic algorithms with a fast problem specific local search heuristic to find the best possible solution within a reasonable computation time. We study the performance of the algorithm over a wide range of parameters such as the number of tasks, the number of processors, the ratio of average communication time to average computation time, and task interaction density of applications. The effectiveness and efficiency of our algorithm are demonstrated by comparing it with recently proposed task allocation algorithms for maximizing system reliability available in the literature.