Abstract
Process migration is used in multicore operating systems to improve their performance. The implementation of the migration event contributes largely to the performance of the scheduling algorithm and hence decides how effective a multicore kernel is. There have been several effective algorithms which decide how a process can be migrated from one core to another in a multicore operating system. This paper looks further into the mechanism of process migration in multicore operating systems. The main aim of this paper is not to answer how the process migration should take place but it aims to answer when process migration should take place and to decide the site of process migration. For this, an artificial intelligence concept called genetic algorithm is used. Genetic algorithm works on the theory of survival of the fittest to find an optimally good solution during decision making phase.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A. Schpbach, S. Peter, A. Baumann, T. Roscoe, P. Barham, T. Harris, and R. Isaacs. Embracing diversity in the Barrelfish manycore operating system. In Workshop on Managed Many-Core Systems, (2008).
Zarrabi, A.; Samsudin, K.; Ziaei, A., “Dynamic process migration framework,” In Information and Communication Technology (ICoICT), International Conference of, pp. 410–415, (2013).
F. Douglis and J. Ousterhout. Transparent Process Migration: Design Alternatives and the Sprite Implementation. Software—Practice and Experience: 757785, (1991).
Pengfei Guo; Xuezhi Wang; Yingshi Han, “The enhanced genetic algorithms for the optimization design,” in Biomedical Engineering and Informatics (BMEI), 3rd International Conference on, pp. 2990–2994, (2010).
Chaiyaratana, N.; Zalzala, A.M.S., “Recent developments in evolutionary and genetic algorithms: theory and applications,” In Genetic Algorithms in Engineering Systems: Innovations and Applications. Second International Conference On, pp. 270–277, (1997).
Maktum, T.A.; Dhumal, R.A.; Ragha, L., “A genetic approach for processor scheduling,” In: Recent Advances and Innovations in Engineering (ICRAIE), 2014, pp. 1–4, 9–11 (2014).
B. Rhoden (2015, November 23), Akaros, http://akaros.cs.berkeley.edu/akaros-web/news.php.
Ian Seyler (2015, November 23), Baremetal, http://www.returninfinity.com/baremetal.html.
Ishikawa, Y., “Highly Efficient Gang Scheduling Implementation,” In Supercomputing. IEEE/ACM Conference on, pp. 43–43, (1998).
Grunewald, W.; Ungerer, T., “Towards extremely fast context switching in a block-multithreaded processor,” In EUROMICRO 96. Beyond 2000: Hardware and Software Design Strategies., pp. 592–599, (1996).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Shravya, K.S., Deepak, A., Chandrasekaran, K. (2017). Using Genetic Algorithm for Process Migration in Multicore Kernels. In: Modi, N., Verma, P., Trivedi, B. (eds) Proceedings of International Conference on Communication and Networks. Advances in Intelligent Systems and Computing, vol 508. Springer, Singapore. https://doi.org/10.1007/978-981-10-2750-5_46
Download citation
DOI: https://doi.org/10.1007/978-981-10-2750-5_46
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-2749-9
Online ISBN: 978-981-10-2750-5
eBook Packages: EngineeringEngineering (R0)