Abstract
We propose a solution of the multiprocessor scheduling problem based on applying a relatively new metaheuristic technique, called Generalized Extremal Optimization (GEO). GEO is inspired by a simple coevolutionary model known as the Bak–Sneppen model. The model describes an ecosystem consisting of N species. Evolution in this model is driven by a process in which the weakest species in the ecosystem, together with its nearest neighbors, is always forced to mutate. This process shows the characteristics of a phenomenon called punctuated equilibrium, which is observed in evolutionary biology. We interpret the multiprocessor scheduling problem in terms of the Bak–Sneppen model and apply the GEO algorithm to solve the problem. We show that the proposed optimization technique is simple and yet outperforms genetic algorithm-based and swarm algorithm-based approaches to the multiprocessor scheduling problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bak, P. (1996). How nature works. New York: Copernicus/Springer.
Bak, P., & Sneppen, K. (1993). Punctuated equilibrium and criticality in a simple model of evolution. Physical Review Letters, 71, 4083–4086.
Beham, A., Winkler, S., Wagner, S., & Affenzeller, M. (2008). Distributed, heterogeneous resource management using artificial immune systems. In Proceedings of the 22nd IEEE international parallel & distributed processing symposium, NIDISC workshop.
Bollobas, B. (1985). Random graphs (pp. 34–42). New York: Academic Press.
Dasgupta, D. (1999). Artificial immune systems and their applications. Berlin: Springer.
Garey, M. P., & Johnson, D. S. (1979). Computers and intractability—a guide to NP-completeness. San Francisco: Freeman.
Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading: Addison-Wesley.
Kennedy, J. (2006). Swarm intelligence. In A. Y. Zomaya (Ed.), Handbook of nature-inspired and innovative computing. Berlin: Springer.
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing (Vol. 220, pp. 671–680). New York: ACM.
Kwok, Y., & Ahmad, I. (1999). Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4), 406–471.
Pardalos, P. M., & Romeijn, H. E. (2002). Handbook of global optimization (Vol. 2). Berlin: Springer.
Seredynski, F., & Zomaya, A. Y. (2002). Sequential and parallel cellular automata-based scheduling algorithms. IEEE Transactions on Parallel and Distributed Systems, 13(10), 1009–1023.
Sousa, F. L., Ramos, F. M., Galski, R. L., & Muraoka, I. (2004). Generalized extremal optimization: a new meta-heuristic inspired by a model of natural evolution. In Recent developments in Biologically inspired computing (pp. 41–60).
Swiecicka, A., Seredynski, F., & Zomaya, A. Y. (2006). Multiprocessor scheduling and rescheduling with use of cellular automata and artificial immune system support. IEEE Transactions on Parallel and Distributed Systems, 17(3), 253–262.
Wilson, L. A. (2008). Distributed, Heterogeneous resource management using artificial immune systems. In Proceedings of the 22nd IEEE international parallel & distributed processing symposium, NIDISC workshop.
Xhafa, F., Alba, E., & Dorronsoro, B. (2007). Efficient batch job scheduling in grids using cellular memetic algorithms. In Proceedings of the 21st IEEE international parallel & distributed processing symposium, NIDISC workshop.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Switalski, P., Seredynski, F. Multiprocessor scheduling by generalized extremal optimization. J Sched 13, 531–543 (2010). https://doi.org/10.1007/s10951-009-0141-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-009-0141-9