<?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">bsuir</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады БГУИР</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady BGUIR</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-7648</issn><issn pub-type="epub">2708-0382</issn><publisher><publisher-name>БГУИР</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">bsuir-709</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></article-categories><title-group><article-title>ОПЕРАЦИИ УПРАВЛЕНИЯ МАССИВАМИ ДАННЫХ В ЛИНЕЙНО АДРЕСУЕМОЙ ПАМЯТИ</article-title><trans-title-group xml:lang="en"><trans-title>OPERATIONS ON MANAGEMENT DATA ARRAYS IN LINEAR MEMORY</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>Ivashenko</surname><given-names>V. P.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><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>Sintsov</surname><given-names>S. V.</given-names></name></name-alternatives><email xlink:type="simple">noemail@neicon.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2016</year></pub-date><pub-date pub-type="epub"><day>03</day><month>06</month><year>2019</year></pub-date><volume>0</volume><issue>6</issue><fpage>86</fpage><lpage>93</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Ивашенко В.П., Синцов С.В., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Ивашенко В.П., Синцов С.В.</copyright-holder><copyright-holder xml:lang="en">Ivashenko V.P., Sintsov S.V.</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://doklady.bsuir.by/jour/article/view/709">https://doklady.bsuir.by/jour/article/view/709</self-uri><abstract><p>Рассматривается задача управления массивами данных в конечной линейно адресуемой памяти. Как часть решения этой задачи приводится способ реализации операций управления массивами данных, основанный на использовании стратегий распределения участков памяти на уровне управления устройствами исполнения систем, основанных на знаниях. Приводятся результаты тестирования различных стратегий.</p></abstract><trans-abstract xml:lang="en"><p>This paper considers a task of management data arrays in memory. As a part of a solution of the task authors present a way of implementing operations on management data arrays based on strategies of dynamic memory chunks allocation, which is done at the devices management level where knowledge-based system is executed. Tests results of the implementation of the proposed way are presented.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>линейно адресуемая память</kwd><kwd>динамическое распределение</kwd><kwd>участок памяти</kwd></kwd-group><kwd-group xml:lang="en"><kwd>linearly addressable memory</kwd><kwd>dynamic allocation</kwd><kwd>memory location</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">Гаврилова Т.А., Хорошевский В.Ф. Базы знаний интеллектуальных систем. СПб., 2000.</mixed-citation><mixed-citation xml:lang="en">Гаврилова Т.А., Хорошевский В.Ф. Базы знаний интеллектуальных систем. СПб., 2000.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Голенков В.В., Гулякина Н.А. // OSTIS. 2013. С. 55-77.</mixed-citation><mixed-citation xml:lang="en">Голенков В.В., Гулякина Н.А. // OSTIS. 2013. С. 55-77.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Кнут Д. Искусство программирования. Том 1. Основные алгоритмы. М., 2002.</mixed-citation><mixed-citation xml:lang="en">Кнут Д. Искусство программирования. Том 1. Основные алгоритмы. М., 2002.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Кнут Д. Искусство программирования. Том 3. Сортировка и поиск. М., 2014.</mixed-citation><mixed-citation xml:lang="en">Кнут Д. Искусство программирования. Том 3. Сортировка и поиск. М., 2014.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Кормен Т. Алгоритмы: построение и анализ. М., 2013.</mixed-citation><mixed-citation xml:lang="en">Кормен Т. Алгоритмы: построение и анализ. М., 2013.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Новиков Ф. Дискретная математика для программистов. СПб., 2009.</mixed-citation><mixed-citation xml:lang="en">Новиков Ф. Дискретная математика для программистов. СПб., 2009.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Голенков В.В., Гулякина Н.А. // OSTIS. 2012. С. 23-52.</mixed-citation><mixed-citation xml:lang="en">Голенков В.В., Гулякина Н.А. // OSTIS. 2012. С. 23-52.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Masmano M., Ripoll I., Balbastre P. et. al. // Real-Time Systems. 2008. Vol. 40. P. 149-179.</mixed-citation><mixed-citation xml:lang="en">Masmano M., Ripoll I., Balbastre P. et. al. // Real-Time Systems. 2008. Vol. 40. P. 149-179.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">TCMalloc: Thread-Caching Malloc. [Электронный ресурс]. - Режим доступа: https://google-perftools.googlecode.com/svn/trunk/doc/tcmalloc.html. Дата доступа: 20.03.2016.</mixed-citation><mixed-citation xml:lang="en">TCMalloc: Thread-Caching Malloc. [Электронный ресурс]. - Режим доступа: https://google-perftools.googlecode.com/svn/trunk/doc/tcmalloc.html. Дата доступа: 20.03.2016.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Evans J. // Proceedings 3rd Technical BSD Conference. Ottawa, May 12-13, 2006.</mixed-citation><mixed-citation xml:lang="en">Evans J. // Proceedings 3rd Technical BSD Conference. Ottawa, May 12-13, 2006.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Berger E., McKinley K., Blumofe R. et. al. // Proc. 9th International Conference on ASPLOS. Cambridge, Nov. 12-15, 2000.</mixed-citation><mixed-citation xml:lang="en">Berger E., McKinley K., Blumofe R. et. al. // Proc. 9th International Conference on ASPLOS. Cambridge, Nov. 12-15, 2000.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Lockless: Benchmarks of the Lockless Memory Allocator. [Электронный ресурс]. - Режим доступа: http://locklessinc.com/benchmarks_allocator.shtml. Дата доступа: 20.03.2016.</mixed-citation><mixed-citation xml:lang="en">Lockless: Benchmarks of the Lockless Memory Allocator. [Электронный ресурс]. - Режим доступа: http://locklessinc.com/benchmarks_allocator.shtml. Дата доступа: 20.03.2016.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Ивашенко В.П. // Карповские научные чтения : сб. науч. ст. Часть 1. 2012. № 6. С. 196-201.</mixed-citation><mixed-citation xml:lang="en">Ивашенко В.П. // Карповские научные чтения : сб. науч. ст. Часть 1. 2012. № 6. С. 196-201.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Robson J. M. // ACM Computer Journal. 1977. Vol. 20. P. 242-244.</mixed-citation><mixed-citation xml:lang="en">Robson J. M. // ACM Computer Journal. 1977. Vol. 20. P. 242-244.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Brodnik A., Carlsson S., Demaine E.D. et. al. // Proc. of 6th International WADS. London, 1999. P. 37-48.</mixed-citation><mixed-citation xml:lang="en">Brodnik A., Carlsson S., Demaine E.D. et. al. // Proc. of 6th International WADS. London, 1999. P. 37-48.</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>
