Методи управління ресурсами і додатками в обчислювальних системах на базі хмарних технологій
DOI :
https://doi.org/10.15587/2313-8416.2015.46591Mots-clés :
інформаційна система, хмарні обчислення, віртуальні ресурси, розподіл навантаження, керування ресурсамиRésumé
В даній статті описано методи керування ресурсами і додатками, що знаходяться в складі інформаційної системи для наукових досліджень (ІСНД). Представлено модель керування потоками запитів в ІСНД і приведено результати досліджень реальної хмарної системи з використанням додаткового модуля розподілення навантаження, запрограмованого на мові Python
Références
Armbrust, M., Fox, A., Griffith, R. (2009). Above the Clouds: A Berkeley view of cloud computing, Science, 1, 191–196.
Matsueva, K. (2015). Methods of resource management and applications in computing systems based on cloud computing. Tenth International Scientific Conference Mathematical and simulation systems. MODS' 2015, 89–90.
Buyya, R. (2011). Cloud Computing. Principles and Paradigms. John Wiley, 675. doi: 10.1002/9780470940105
Blazewicz, J. (2007). Handbook on Scheduling. From Theory to Applications. Berlin: Springer, 647.
Jones, W. M. (2014). Beowulf Mini-grid Scheduling. The Pennsylvania State University. Available at: http://citeseer.ist.psu.edu/696342.html
Aida, K., Kasahara, H., Narita, S. (1998). Job scheduling scheme for pure space sharing among rigid jobs. Lecture Notes in Computer Science, 98–121. doi: 10.1007/bfb0053983
Sinnen, O., Sousa, L. A. (2005). Communication contention in task scheduling. IEEE Transactions on Parallel and Distributed Systems, 16 (6), 503–515. doi: 10.1109/tpds.2005.64
Sinnen, O. (2005). Communication contention in task scheduling. IEEE Transactions on Parallel and Distributed Systems, 16 (6), 503–515.
Gergel, V. P. (2010). Research of scheduling algorithms of parallel tasks for cluster computing systems using the simulator. Bulletin of the Nizhny Novgorod University N. I. Lobachevskogo, 5 (1), 201–208.
Brucker, P. (2007). Scheduling Algorithms.Berlin. Springer, 371. doi: 10.1007/978-3-662-03088-2
Bender, M. A., Bunde, D. P., Demaine, E. D., Fekete, S. P., Leung, V. J., Meijer, H., Phillips, C. A. (2005). Communication-Aware Processor Allocation for Supercomputers. Lecture Notes in Computer Science, 3608, 169–181. doi: 10.1007/11534273_16
Pinedo, M. L. (2009). Planning and Scheduling in Manufacturing and Services. LLC: Springer Science. Business Media, 509. doi: 10.1007/978-1-4419-0910-7_14
Petrov, D. (2010). Optimal algorithm of data migration in scalable cloud storages. System management, 30, 180–197.
Borodin, A., El-Yaniv, R. (1998). Online computation and competitive analysis. Cambridge University Press, NewYork, 53.
Aspnes, J. (1998). Competitive analysis of distributed algorithms. Lecture Notes in Computer Science, 118–146. doi: 10.1007/bfb0029567
OpenStack Open Source Cloud Computing Software. Available at: http://www.openstack.org/
Téléchargements
Publié-e
Numéro
Rubrique
Licence
(c) Tous droits réservés Карина Андріївна Мацуєва 2015
Cette œuvre est sous licence Creative Commons Attribution 4.0 International.
Our journal abides by the Creative Commons CC BY copyright rights and permissions for open access journals.
Authors, who are published in this journal, agree to the following conditions:
1. The authors reserve the right to authorship of the work and pass the first publication right of this work to the journal under the terms of a Creative Commons CC BY, which allows others to freely distribute the published research with the obligatory reference to the authors of the original work and the first publication of the work in this journal.
2. The authors have the right to conclude separate supplement agreements that relate to non-exclusive work distribution in the form in which it has been published by the journal (for example, to upload the work to the online storage of the journal or publish it as part of a monograph), provided that the reference to the first publication of the work in this journal is included.
