Chaotic simulated annealing algorithm for task allocation in real-time distributed systems

This paper addresses the problem of task allocation in real-time distributed systems with the goal of maximizing the system reliability, which has been shown to be NP-hard. Firstly, we take account of the deadline constraint in order to formulate this problem, and then apply chaotic simulated annealing (CSA) algorithm to solve the problem. The CSA introduces chaotic variable to generate the number of perturbations of neighborhood selection in each iteration, which can be more likely to escape from the local minima. The effectiveness of CSA is evaluated by comparing with conventional simulated annealing algorithm. The results show that CSA has a better performance than SA, both higher reliability and less calculation time.