Real-time task schedule problem in Chip-Multiprocessor (CMP) receives wide attention in recent years. It is partly because the increasing demand for CMP solutions call for better schedule algorithm to exploit the full potential of hardware, and partly because of the complexity of schedule problem, which itself is an NP-hard problem. To address this task schedule problem, various of heuristics have been studied, among which, Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Simulated Annealing (SA) are the most popular ones. In this paper, we implement these 3 schedule heuristics, and compare their performance under the context of real-time tasks scheduling on CMP. According to the results of our intensive simulations, PSO has the best fitness optimization of these 3 algorithms, and SA is the most efficient algorithm.
Dynamic distrubution algorithm for optimization schedule problem on parallel databases.