Abstract
Due to optimal use of processors as well as spending less time, the task scheduling in multiprocessor systems is of great importance. This is one of the NP_hard problems and achieving the optimal schedule or finding the minimum schedule length, using the dynamic algorithm and back-tracking programming, would be time-consuming. Therefore, heuristic methods like genetic algorithms are suitable methods to schedule tasks in a multiprocessor system. In this paper, a new genetic algorithm is presented whose priority of tasks’ execution is based on the number of their children. The results show that our developed algorithm finds the near-optimal schedule in a reasonable computation time, compared to other heuristics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Abdeyazdan, M., Rahmani, A.M. (2008). Multiprocessor Task Scheduling using a new Prioritizing Genetic Algorithm based on number of Task Children. In: Kacsuk, P., Lovas, R., NĂ©meth, Z. (eds) Distributed and Parallel Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-79448-8_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-79448-8_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-79447-1
Online ISBN: 978-0-387-79448-8
eBook Packages: Computer ScienceComputer Science (R0)