Task allocation for maximizing reliability of a distributed system using hybrid particle swarm optimization

  • Authors:

  • Peng-Yeng Yin;Shiuh-Sheng Yu;Pei-Pei Wang;Yi-Te Wang

  • Affiliations:

  • Department of Information Management, National Chi Nan University, 303 University Road, Puli, Nantou 545, Taiwan;Department of Information Management, National Chi Nan University, 303 University Road, Puli, Nantou 545, Taiwan;Department of Information Management, National Chi Nan University, 303 University Road, Puli, Nantou 545, Taiwan;Department of Information Management, National Chi Nan University, 303 University Road, Puli, Nantou 545, Taiwan

  • Venue:
  • Journal of Systems and Software
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a distributed computing system, a number of program modules may need to be allocated to different processors such that the reliability of executing successfully these modules is maximized and the constraints with limited resources are satisfied. The problem of finding an optimal task allocation with maximum system reliability has been shown to be NP-hard; thus, existing approaches to finding exact solutions are limited to the use in problems of small size. This paper presents a hybrid particle swarm optimization (HPSO) algorithm for finding the near-optimal task allocation within reasonable time. The experimental results show that the HPSO is robust against different problem size, task interaction density, and network topology. The proposed method is also more effective and efficient than a genetic algorithm for the test-cases studied. The convergence and the worst-case characteristics of the HPSO are addressed using both theoretical and empirical analysis.