Generalized Extremal Optimization for Solving Multiprocessor Task Scheduling Problem
In this paper we propose a solution of a multiprocessor task scheduling problem with use of a new meta-heuristic inspired by a model of natural evolution called Generalized Extremal Optimization (GEO). It is inspired by a simple co-evolutionary model based on a Bak-Sneppen model. One of advantages of the model is a simple implementation of potential optimization problems and only one free parameter to adjust. The idea of GEO metaheuristic and the way of applying it to the multi-processor scheduling problem are presented in the paper. In this problem the tasks of a program graph are allocated into multiprocessor system graph where the program completion time is minimized. The problem is know to be a NP-complete problem. In this paper we show that GEO is to able to solve this problem with better performance than genetic algorithm.
Keywordsmultiprocessor task scheduling problem Generalized Extremal Optimization GEO genetic algorithm
Unable to display preview. Download preview PDF.
- Eldred, M.S.: Optimization Strategies for Complex Engineering Applications. San-dia Technical Report SAND98-0340 (1998)Google Scholar
- Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)Google Scholar
- Sousa, F.L., Ramos, F.M., Galski, R.L., Muraoka, I.: Generalized Extremal Optimization: A New Meta-heuristic Inspired by a Model of Natural Evolution. Recent Developments in Biologically Inspired Computing, 41–60 (2004)Google Scholar