<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2014-4-13-24</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-94</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Оригинальные статьи</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>Articles</subject></subj-group></article-categories><title-group><article-title>Применение стохастических метаэвристик в задаче управления данными в мультиклиентском кластере баз данных</article-title><trans-title-group xml:lang="en"><trans-title>Applying Stochastic Metaheuristics to the Problem of Data Management in a Multi-Tenant Database Cluster</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Бойцов</surname><given-names>Евгений Александрович</given-names></name><name name-style="western" xml:lang="en"><surname>Boytsov</surname><given-names>E. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>аспирант кафедры теоретической информатики, 150000 Россия, г. Ярославль, ул. Советская, 14</p></bio><bio xml:lang="en"><p>аспирант кафедры теоретической информатики, Sovetskaya str., 14, Yaroslavl, 150000, Russia</p></bio><email xlink:type="simple">boytsovea@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Ярославский государственный университет им. П.Г. Демидова</institution><country>Россия</country></aff><aff xml:lang="en"><institution>P.G. Demidov Yaroslavl State University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2014</year></pub-date><pub-date pub-type="epub"><day>20</day><month>08</month><year>2014</year></pub-date><volume>21</volume><issue>4</issue><fpage>13</fpage><lpage>24</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Бойцов Е.А., 2014</copyright-statement><copyright-year>2014</copyright-year><copyright-holder xml:lang="ru">Бойцов Е.А.</copyright-holder><copyright-holder xml:lang="en">Boytsov E.A.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/94">https://www.mais-journal.ru/jour/article/view/94</self-uri><abstract><p>Мультиклиентский кластер баз данных – это концепция хранилища данных для облачных приложений с мультиклиентской архитектурой. Кластер представляет собой набор серверов реляционных баз данных с единой точкой входа, объединенных в одно целое и работающих под управлением контроллера кластера. Данная система нацелена на использование приложениями, разрабатываемыми в соответствии с парадигмой Software as a Service (SaaS), и позволяет разместить на предоставленных серверах данные большого количества клиентов таким образом, чтобы обеспечить их изоляцию, резервирование и наиболее эффективное использование предоставленных вычислительных мощностей. Одной из наиболее важных задач при разработке системы подобного рода является эффективное распределение данных по серверам, которое определяет степень загруженности отдельных узлов, а также устойчивость системы к сбоям. В работе рассматривается подход к управлению данными, основанный на применении функции оценки эффективности балансировки нагрузки. Данная функция применяется как при первичном размещении клиентов, так и для оптимизации уже имеющегося распределения клиентов. Оптимизация размещения ведется по стандартным схемам стохастических метаэвристик: имитации отжига (simulated annealing) и поиска с запретами (tabu search).</p></abstract><trans-abstract xml:lang="en"><p>A multi-tenant database cluster is a concept of a data-storage subsystem for cloud applications with the multi-tenant architecture. The cluster is a set of relational database servers with the single entry point, combined into one unit with a cluster controller. This system is aimed to be used by applications developed according to Software as a Service (SaaS) paradigm and allows to place tenants at database servers so that providing their isolation, data backup and the most effective usage of available computational power. One of the most important problems about such a system is an effective distribution of data into servers, which affects the degree of individual cluster nodes load and faulttolerance. This paper considers the data-management approach, based on the usage of a load-balancing quality measure function. This function is used during initial placement of new tenants and also during placement optimization steps. Standard schemes of metaheuristic optimization such as simulated annealing and tabu search are used to find a better tenant placement.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>базы данных</kwd><kwd>SaaS</kwd><kwd>мультиклиентская архитектура</kwd><kwd>стохастическая оптимизация</kwd></kwd-group><kwd-group xml:lang="en"><kwd>databases</kwd><kwd>SaaS</kwd><kwd>multi-tenant architecture</kwd><kwd>stochastic optimization</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Chong F., Carraro G. Architecture strategies for catching the long tail. — 2006. — URL: http://msdn.microsoft.com/en-us/library/aa479069.aspx.</mixed-citation><mixed-citation xml:lang="en">Chong F., Carraro G. Architecture strategies for catching the long tail. — 2006. — URL: http://msdn.microsoft.com/en-us/library/aa479069.aspx.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Chong F., Carraro G., Wolter R. Multi-tenant data architecture. — 2006. — URL: http://msdn.microsoft.com/en-us/library/aa479086.aspx.</mixed-citation><mixed-citation xml:lang="en">Chong F., Carraro G., Wolter R. Multi-tenant data architecture. — 2006. — URL: http://msdn.microsoft.com/en-us/library/aa479086.aspx.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Boytsov E., Sokolov V. The problem of creating multi-tenant database clusters // Proceedings of SYRCoSE. — Perm, 2012. — P. 172–177.</mixed-citation><mixed-citation xml:lang="en">Boytsov E., Sokolov V. The problem of creating multi-tenant database clusters // Proceedings of SYRCoSE. — Perm, 2012. — P. 172–177.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Boytsov E. Designing and development of the imitation model of a multi-tenant database cluster // Modeling and Analysis of Information Systems. — 2013. — Vol. 20, no. 4. — P. 136–149.</mixed-citation><mixed-citation xml:lang="en">Boytsov E. Designing and development of the imitation model of a multi-tenant database cluster // Modeling and Analysis of Information Systems. — 2013. — Vol. 20, no. 4. — P. 136–149.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Boytsov E., Sokolov V. The formal statement of the load-balancing problem for a multi-tenant database cluster with a constant flow of queries // Proceedings of the Spring/Summer Young Researchers’ Colloquium on Software Engineering. — Kazan, 2013. — P. 117–12.</mixed-citation><mixed-citation xml:lang="en">Boytsov E., Sokolov V. The formal statement of the load-balancing problem for a multi-tenant database cluster with a constant flow of queries // Proceedings of the Spring/Summer Young Researchers’ Colloquium on Software Engineering. — Kazan, 2013. — P. 117–12.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Boytsov E., Sokolov V. Comparison of data management strategies for multi-tenant database cluster // Proceedings of the International Symposium on Business Modelling and Software Design. — Luxembourg, 2014. — P. 217–222.</mixed-citation><mixed-citation xml:lang="en">Boytsov E., Sokolov V. Comparison of data management strategies for multi-tenant database cluster // Proceedings of the International Symposium on Business Modelling and Software Design. — Luxembourg, 2014. — P. 217–222.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Beckman M., Koopmans T. Assignment problems and the location of economic activities // Econometrica. — 1957. — Vol. 25. — P. 53–76.</mixed-citation><mixed-citation xml:lang="en">Beckman M., Koopmans T. Assignment problems and the location of economic activities // Econometrica. — 1957. — Vol. 25. — P. 53–76.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">The generalized quadratic assignment problem : Rep. / University of Toronto, Department of Mechanical and Industrial Engineering ; Executor: C.-G. Lee, Z. Ma. — Toronto, Canada : 2004.</mixed-citation><mixed-citation xml:lang="en">The generalized quadratic assignment problem : Rep. / University of Toronto, Department of Mechanical and Industrial Engineering ; Executor: C.-G. Lee, Z. Ma. — Toronto, Canada : 2004.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Sahni S., Gonzalez T. P-complete approximation problems. // Journal of ACM. — 1976. — Vol. 23, no. 3. — P. 555–565.</mixed-citation><mixed-citation xml:lang="en">Sahni S., Gonzalez T. P-complete approximation problems. // Journal of ACM. — 1976. — Vol. 23, no. 3. — P. 555–565.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Burkard R. Locations with spatial interactions: The quadratic assignment problem. // Discrete location theory. — 1991. — P. 387–437.</mixed-citation><mixed-citation xml:lang="en">Burkard R. Locations with spatial interactions: The quadratic assignment problem. // Discrete location theory. — 1991. — P. 387–437.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Rendl F., Pardalos P., Wolkowicz H. The quadratic assignment problem: A survey and recent developments // Proceedings of the DIMACS Workshop on Quadratic Assignment Problems. — Vol. 16. — American Mathematical Society, 1994. — P. 1–42.</mixed-citation><mixed-citation xml:lang="en">Rendl F., Pardalos P., Wolkowicz H. The quadratic assignment problem: A survey and recent developments // Proceedings of the DIMACS Workshop on Quadratic Assignment Problems. — Vol. 16. — American Mathematical Society, 1994. — P. 1–42.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Burkard R., Cela E. Quadratic and three-dimensional assignment problems // Annotated Bibliographies in Combinatorial Optimization. — Chichester : Wiley, 1997. — P. 373–392.</mixed-citation><mixed-citation xml:lang="en">Burkard R., Cela E. Quadratic and three-dimensional assignment problems // Annotated Bibliographies in Combinatorial Optimization. — Chichester : Wiley, 1997. — P. 373–392.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Holland J. H. Adaptation in Natural and Artificial Systems. — Cambridge : MIT Press, 1992.</mixed-citation><mixed-citation xml:lang="en">Holland J. H. Adaptation in Natural and Artificial Systems. — Cambridge : MIT Press, 1992.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Kirkpatrick S., Gelatt C. D., Vecchi M. P. Optimization by simulated annealing // SCIENCE. — 1983. — Vol. 220, no. 4598. — P. 671–680.</mixed-citation><mixed-citation xml:lang="en">Kirkpatrick S., Gelatt C. D., Vecchi M. P. Optimization by simulated annealing // SCIENCE. — 1983. — Vol. 220, no. 4598. — P. 671–680.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Glover F. Future paths for integer programming and links to artificial intelligence // Computers and Operation Research. — 1986. — Vol. 13, no. 5. — P. 533–549.</mixed-citation><mixed-citation xml:lang="en">Glover F. Future paths for integer programming and links to artificial intelligence // Computers and Operation Research. — 1986. — Vol. 13, no. 5. — P. 533–549.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Elmore A., Das S., Agrawal D., El Abbadi A. Zephyr: Live migration in shared nothing databases for elastic cloud platforms // Proceedings of the ACM SIGMOD International Conference on Management of Data. — New York, 2011. — P. 301–312.</mixed-citation><mixed-citation xml:lang="en">Elmore A., Das S., Agrawal D., El Abbadi A. Zephyr: Live migration in shared nothing databases for elastic cloud platforms // Proceedings of the ACM SIGMOD International Conference on Management of Data. — New York, 2011. — P. 301–312.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
