Abstract
We present computer simulation of population evolution at different locations, with migration between the sites. Calculations are based on the Penna model, with suitable modifications for the migration. We present some examples of the population growth for different scenario of the migration rules. Calculations requires about 100M Bmemory for 106 population which is a minimum necessary to get reliable statistics. Typical running time for 3000 iteration steps is several hours for HP S2000 machine. The problem is very suitable for parallelization with geometrical decomposition, especially for small migration limit.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Penna, T.J.P., A Bit-String Model for Biological Ageing, J. Statist. Phys. 78 (1995) 1629.
Penna, T.J.P. and Stauffer, D., Efficient Monte Carlo Simulations for Biological Ageing, Int. J. Mod. Phys. C6 (1995) 233.
Magdoń, M.S. and Maksymowicz, A.Z., Penna model in migrating population-effect of environmental factor and genetics, Physica, A273 (1999) 182–189.
Magdoń, M.S., Effect of migration on population dynamics, Int. J. Mod. Phys., 10 (1999) 1163–1174.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maksymowicz, A.Z., Gronek, P., Alda, W., Magdoń-Maksymowicz, M.S., Kopeć, M., Dydejczyk, A. (2000). Population Growth in the Penna Model for Migrating Population. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_69
Download citation
DOI: https://doi.org/10.1007/3-540-45492-6_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67553-2
Online ISBN: 978-3-540-45492-2
eBook Packages: Springer Book Archive